./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 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU --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-9ad7fb2 [2021-11-02 22:47:28,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:47:28,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:47:28,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:47:28,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:47:28,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:47:28,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:47:28,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:47:28,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:47:28,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:47:28,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:47:28,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:47:28,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:47:28,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:47:28,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:47:28,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:47:28,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:47:28,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:47:28,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:47:28,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:47:28,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:47:28,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:47:28,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:47:28,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:47:28,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:47:28,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:47:28,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:47:28,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:47:28,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:47:28,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:47:28,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:47:28,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:47:28,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:47:28,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:47:28,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:47:28,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:47:28,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:47:28,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:47:28,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:47:28,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:47:28,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:47:28,956 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 22:47:28,994 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:47:28,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:47:28,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:47:29,000 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:47:29,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:47:29,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:47:29,007 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:47:29,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:47:29,008 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:47:29,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:47:29,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:47:29,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:47:29,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:47:29,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:47:29,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:47:29,010 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:47:29,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:47:29,010 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:47:29,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:47:29,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:47:29,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:47:29,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:47:29,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:47:29,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:47:29,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:47:29,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:47:29,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:47:29,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:47:29,014 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:47:29,015 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:47:29,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:47:29,015 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:47:29,015 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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU 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-02 22:47:29,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:47:29,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:47:29,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:47:29,383 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:47:29,384 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:47:29,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-02 22:47:29,460 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/e8472bbbe/e85212d1c547402c86b81fdfd493fff8/FLAG71cdf95e0 [2021-11-02 22:47:30,198 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:47:30,199 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-02 22:47:30,237 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/e8472bbbe/e85212d1c547402c86b81fdfd493fff8/FLAG71cdf95e0 [2021-11-02 22:47:30,357 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/e8472bbbe/e85212d1c547402c86b81fdfd493fff8 [2021-11-02 22:47:30,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:47:30,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:47:30,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:47:30,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:47:30,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:47:30,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:47:30" (1/1) ... [2021-11-02 22:47:30,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ca06a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:30, skipping insertion in model container [2021-11-02 22:47:30,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:47:30" (1/1) ... [2021-11-02 22:47:30,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:47:30,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:47:31,049 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_165726e1-0dc9-4d06-a403-135af47edaf5/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-02 22:47:31,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:47:31,094 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:47:31,254 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_165726e1-0dc9-4d06-a403-135af47edaf5/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-02 22:47:31,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:47:31,278 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:47:31,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31 WrapperNode [2021-11-02 22:47:31,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:47:31,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:47:31,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:47:31,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:47:31,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,318 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:47:31,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:47:31,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:47:31,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:47:31,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:47:31,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:47:31,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:47:31,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:47:31,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (1/1) ... [2021-11-02 22:47:31,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:47:31,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:47:31,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:47:31,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:47:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:47:31,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:47:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 22:47:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 22:47:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:47:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:47:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:47:31,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:47:31,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:47:32,072 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 22:47:33,821 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-02 22:47:33,822 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-02 22:47:33,832 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:47:33,833 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-02 22:47:33,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:47:33 BoogieIcfgContainer [2021-11-02 22:47:33,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:47:33,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:47:33,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:47:33,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:47:33,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:47:30" (1/3) ... [2021-11-02 22:47:33,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7d1bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:47:33, skipping insertion in model container [2021-11-02 22:47:33,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:47:31" (2/3) ... [2021-11-02 22:47:33,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7d1bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:47:33, skipping insertion in model container [2021-11-02 22:47:33,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:47:33" (3/3) ... [2021-11-02 22:47:33,863 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-11-02 22:47:33,870 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:47:33,883 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 22:47:33,997 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:47:34,020 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-02 22:47:34,020 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-02 22:47:34,043 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-02 22:47:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:47:34,053 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:34,054 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-02 22:47:34,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:34,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:34,061 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2021-11-02 22:47:34,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:34,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238885177] [2021-11-02 22:47:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:34,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:34,600 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-02 22:47:34,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:34,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238885177] [2021-11-02 22:47:34,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238885177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:34,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:34,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:34,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688052383] [2021-11-02 22:47:34,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:34,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:34,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:34,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:34,632 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-02 22:47:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:37,346 INFO L93 Difference]: Finished difference Result 325 states and 550 transitions. [2021-11-02 22:47:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:37,349 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-02 22:47:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:37,366 INFO L225 Difference]: With dead ends: 325 [2021-11-02 22:47:37,367 INFO L226 Difference]: Without dead ends: 165 [2021-11-02 22:47:37,376 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-02 22:47:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-02 22:47:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2021-11-02 22:47:37,449 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-02 22:47:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 229 transitions. [2021-11-02 22:47:37,456 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 229 transitions. Word has length 37 [2021-11-02 22:47:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:37,457 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 229 transitions. [2021-11-02 22:47:37,457 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-02 22:47:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 229 transitions. [2021-11-02 22:47:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 22:47:37,462 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:37,462 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-02 22:47:37,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:47:37,463 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1650885502, now seen corresponding path program 1 times [2021-11-02 22:47:37,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:37,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112726563] [2021-11-02 22:47:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:37,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:37,658 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-02 22:47:37,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:37,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112726563] [2021-11-02 22:47:37,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112726563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:37,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:37,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:37,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852587869] [2021-11-02 22:47:37,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:37,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:37,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:37,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:37,663 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-02 22:47:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:40,236 INFO L93 Difference]: Finished difference Result 292 states and 446 transitions. [2021-11-02 22:47:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:40,237 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-02 22:47:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:40,240 INFO L225 Difference]: With dead ends: 292 [2021-11-02 22:47:40,240 INFO L226 Difference]: Without dead ends: 165 [2021-11-02 22:47:40,242 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-02 22:47:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-02 22:47:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2021-11-02 22:47:40,255 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-02 22:47:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2021-11-02 22:47:40,260 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 50 [2021-11-02 22:47:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:40,261 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2021-11-02 22:47:40,261 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-02 22:47:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2021-11-02 22:47:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 22:47:40,264 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:40,264 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-02 22:47:40,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:47:40,265 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash -24642669, now seen corresponding path program 1 times [2021-11-02 22:47:40,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:40,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797000720] [2021-11-02 22:47:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:40,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:40,452 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-02 22:47:40,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:40,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797000720] [2021-11-02 22:47:40,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797000720] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:40,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:40,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:40,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277082537] [2021-11-02 22:47:40,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:40,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:40,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:40,467 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-02 22:47:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:42,992 INFO L93 Difference]: Finished difference Result 291 states and 444 transitions. [2021-11-02 22:47:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:42,993 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-02 22:47:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:42,995 INFO L225 Difference]: With dead ends: 291 [2021-11-02 22:47:42,995 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 22:47:42,997 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-02 22:47:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 22:47:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2021-11-02 22:47:43,009 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-02 22:47:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2021-11-02 22:47:43,010 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 51 [2021-11-02 22:47:43,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:43,010 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2021-11-02 22:47:43,011 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-02 22:47:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2021-11-02 22:47:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 22:47:43,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:43,014 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-02 22:47:43,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 22:47:43,015 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash 840936487, now seen corresponding path program 1 times [2021-11-02 22:47:43,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:43,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69164961] [2021-11-02 22:47:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:43,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:43,153 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-02 22:47:43,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:43,154 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69164961] [2021-11-02 22:47:43,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69164961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:43,154 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:43,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:43,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350405886] [2021-11-02 22:47:43,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:43,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:43,157 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-02 22:47:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:45,658 INFO L93 Difference]: Finished difference Result 291 states and 443 transitions. [2021-11-02 22:47:45,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:45,659 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-02 22:47:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:45,661 INFO L225 Difference]: With dead ends: 291 [2021-11-02 22:47:45,661 INFO L226 Difference]: Without dead ends: 164 [2021-11-02 22:47:45,662 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-02 22:47:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-02 22:47:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2021-11-02 22:47:45,687 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-02 22:47:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 226 transitions. [2021-11-02 22:47:45,689 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 226 transitions. Word has length 51 [2021-11-02 22:47:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:45,689 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 226 transitions. [2021-11-02 22:47:45,690 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-02 22:47:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 226 transitions. [2021-11-02 22:47:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 22:47:45,697 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:45,698 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-02 22:47:45,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 22:47:45,699 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash 451751422, now seen corresponding path program 1 times [2021-11-02 22:47:45,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:45,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681349627] [2021-11-02 22:47:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:45,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:45,864 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-02 22:47:45,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:45,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681349627] [2021-11-02 22:47:45,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681349627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:45,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:45,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:45,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060496545] [2021-11-02 22:47:45,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:45,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:45,868 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-02 22:47:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:48,135 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2021-11-02 22:47:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:48,136 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-02 22:47:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:48,137 INFO L225 Difference]: With dead ends: 290 [2021-11-02 22:47:48,137 INFO L226 Difference]: Without dead ends: 163 [2021-11-02 22:47:48,138 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-02 22:47:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-11-02 22:47:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2021-11-02 22:47:48,145 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-02 22:47:48,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2021-11-02 22:47:48,146 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 51 [2021-11-02 22:47:48,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:48,146 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2021-11-02 22:47:48,146 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-02 22:47:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2021-11-02 22:47:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 22:47:48,148 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:48,148 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-02 22:47:48,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 22:47:48,149 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:48,149 INFO L85 PathProgramCache]: Analyzing trace with hash -88394050, now seen corresponding path program 1 times [2021-11-02 22:47:48,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:48,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028862357] [2021-11-02 22:47:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:48,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:48,221 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-02 22:47:48,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:48,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028862357] [2021-11-02 22:47:48,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028862357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:48,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:48,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:48,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863687079] [2021-11-02 22:47:48,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:48,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:48,224 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-02 22:47:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:50,403 INFO L93 Difference]: Finished difference Result 288 states and 438 transitions. [2021-11-02 22:47:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:50,404 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-02 22:47:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:50,405 INFO L225 Difference]: With dead ends: 288 [2021-11-02 22:47:50,405 INFO L226 Difference]: Without dead ends: 161 [2021-11-02 22:47:50,406 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-02 22:47:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-02 22:47:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-02 22:47:50,416 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-02 22:47:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2021-11-02 22:47:50,416 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 51 [2021-11-02 22:47:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:50,417 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2021-11-02 22:47:50,417 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-02 22:47:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2021-11-02 22:47:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-02 22:47:50,418 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:50,419 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-02 22:47:50,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 22:47:50,419 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:50,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -388419541, now seen corresponding path program 1 times [2021-11-02 22:47:50,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:50,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21021929] [2021-11-02 22:47:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:50,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:50,508 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-02 22:47:50,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:50,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21021929] [2021-11-02 22:47:50,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21021929] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:50,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:50,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:50,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8335260] [2021-11-02 22:47:50,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:50,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:50,512 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-02 22:47:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:52,642 INFO L93 Difference]: Finished difference Result 288 states and 437 transitions. [2021-11-02 22:47:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:52,643 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-02 22:47:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:52,645 INFO L225 Difference]: With dead ends: 288 [2021-11-02 22:47:52,645 INFO L226 Difference]: Without dead ends: 161 [2021-11-02 22:47:52,646 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-02 22:47:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-02 22:47:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-02 22:47:52,652 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-02 22:47:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2021-11-02 22:47:52,654 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 52 [2021-11-02 22:47:52,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:52,654 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2021-11-02 22:47:52,654 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-02 22:47:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2021-11-02 22:47:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 22:47:52,656 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:52,657 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-02 22:47:52,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 22:47:52,657 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -162201364, now seen corresponding path program 1 times [2021-11-02 22:47:52,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:52,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632071342] [2021-11-02 22:47:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:52,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:52,755 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-02 22:47:52,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:52,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632071342] [2021-11-02 22:47:52,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632071342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:52,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:52,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:52,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703029813] [2021-11-02 22:47:52,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:52,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:52,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:52,759 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-02 22:47:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:55,157 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2021-11-02 22:47:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:55,158 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-02 22:47:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:55,160 INFO L225 Difference]: With dead ends: 288 [2021-11-02 22:47:55,160 INFO L226 Difference]: Without dead ends: 161 [2021-11-02 22:47:55,161 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-02 22:47:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-11-02 22:47:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2021-11-02 22:47:55,167 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-02 22:47:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2021-11-02 22:47:55,168 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 53 [2021-11-02 22:47:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:55,168 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2021-11-02 22:47:55,169 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-02 22:47:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2021-11-02 22:47:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 22:47:55,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:55,170 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-02 22:47:55,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 22:47:55,171 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2057823088, now seen corresponding path program 1 times [2021-11-02 22:47:55,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:55,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934110428] [2021-11-02 22:47:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:55,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:55,301 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-02 22:47:55,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:55,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934110428] [2021-11-02 22:47:55,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934110428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:55,302 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:55,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:55,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146261397] [2021-11-02 22:47:55,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:55,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:55,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:55,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:55,304 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-02 22:47:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:57,665 INFO L93 Difference]: Finished difference Result 278 states and 422 transitions. [2021-11-02 22:47:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:57,666 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-02 22:47:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:57,668 INFO L225 Difference]: With dead ends: 278 [2021-11-02 22:47:57,668 INFO L226 Difference]: Without dead ends: 151 [2021-11-02 22:47:57,669 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-02 22:47:57,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-11-02 22:47:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2021-11-02 22:47:57,674 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-02 22:47:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2021-11-02 22:47:57,675 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 54 [2021-11-02 22:47:57,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:57,675 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2021-11-02 22:47:57,676 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-02 22:47:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2021-11-02 22:47:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 22:47:57,677 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:57,677 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-02 22:47:57,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 22:47:57,677 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1297584632, now seen corresponding path program 1 times [2021-11-02 22:47:57,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:57,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927003697] [2021-11-02 22:47:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:57,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:57,782 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-02 22:47:57,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:57,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927003697] [2021-11-02 22:47:57,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927003697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:57,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:57,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:57,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532593359] [2021-11-02 22:47:57,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:57,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:57,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:57,785 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-02 22:47:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:47:59,204 INFO L93 Difference]: Finished difference Result 318 states and 483 transitions. [2021-11-02 22:47:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:47:59,205 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-02 22:47:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:47:59,207 INFO L225 Difference]: With dead ends: 318 [2021-11-02 22:47:59,207 INFO L226 Difference]: Without dead ends: 191 [2021-11-02 22:47:59,208 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-02 22:47:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-02 22:47:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2021-11-02 22:47:59,214 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-02 22:47:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2021-11-02 22:47:59,216 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 54 [2021-11-02 22:47:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:47:59,216 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2021-11-02 22:47:59,217 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-02 22:47:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2021-11-02 22:47:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-02 22:47:59,218 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:47:59,218 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-02 22:47:59,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 22:47:59,219 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:47:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:47:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1819095073, now seen corresponding path program 1 times [2021-11-02 22:47:59,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:47:59,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832852291] [2021-11-02 22:47:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:47:59,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:47:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:47:59,295 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-02 22:47:59,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:47:59,296 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832852291] [2021-11-02 22:47:59,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832852291] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:47:59,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:47:59,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:47:59,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589625941] [2021-11-02 22:47:59,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:47:59,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:47:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:47:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:47:59,299 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-02 22:48:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:01,449 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2021-11-02 22:48:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:01,450 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-02 22:48:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:01,452 INFO L225 Difference]: With dead ends: 340 [2021-11-02 22:48:01,452 INFO L226 Difference]: Without dead ends: 191 [2021-11-02 22:48:01,453 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-02 22:48:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-11-02 22:48:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2021-11-02 22:48:01,459 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-02 22:48:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2021-11-02 22:48:01,461 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 67 [2021-11-02 22:48:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:01,461 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2021-11-02 22:48:01,461 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-02 22:48:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2021-11-02 22:48:01,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-02 22:48:01,463 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:01,463 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-02 22:48:01,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 22:48:01,463 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:01,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:01,464 INFO L85 PathProgramCache]: Analyzing trace with hash 170572756, now seen corresponding path program 1 times [2021-11-02 22:48:01,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:01,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096620163] [2021-11-02 22:48:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:01,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:01,532 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-02 22:48:01,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:01,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096620163] [2021-11-02 22:48:01,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096620163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:01,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:01,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:01,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997407923] [2021-11-02 22:48:01,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:01,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:01,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:01,535 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-02 22:48:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:03,911 INFO L93 Difference]: Finished difference Result 339 states and 517 transitions. [2021-11-02 22:48:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:03,912 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-02 22:48:03,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:03,914 INFO L225 Difference]: With dead ends: 339 [2021-11-02 22:48:03,914 INFO L226 Difference]: Without dead ends: 190 [2021-11-02 22:48:03,915 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-02 22:48:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-02 22:48:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2021-11-02 22:48:03,921 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-02 22:48:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 257 transitions. [2021-11-02 22:48:03,922 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 257 transitions. Word has length 68 [2021-11-02 22:48:03,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:03,922 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 257 transitions. [2021-11-02 22:48:03,923 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-02 22:48:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2021-11-02 22:48:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-02 22:48:03,924 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:03,925 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-02 22:48:03,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 22:48:03,925 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:03,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1036151912, now seen corresponding path program 1 times [2021-11-02 22:48:03,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:03,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200713222] [2021-11-02 22:48:03,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:03,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:04,024 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-02 22:48:04,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:04,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200713222] [2021-11-02 22:48:04,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200713222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:04,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:04,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:04,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923511633] [2021-11-02 22:48:04,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:04,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:04,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:04,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:04,028 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-02 22:48:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:05,158 INFO L93 Difference]: Finished difference Result 339 states and 515 transitions. [2021-11-02 22:48:05,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:05,159 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-02 22:48:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:05,161 INFO L225 Difference]: With dead ends: 339 [2021-11-02 22:48:05,161 INFO L226 Difference]: Without dead ends: 190 [2021-11-02 22:48:05,162 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-02 22:48:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-11-02 22:48:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2021-11-02 22:48:05,170 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-02 22:48:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 256 transitions. [2021-11-02 22:48:05,172 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 256 transitions. Word has length 68 [2021-11-02 22:48:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:05,174 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 256 transitions. [2021-11-02 22:48:05,174 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-02 22:48:05,175 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 256 transitions. [2021-11-02 22:48:05,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-02 22:48:05,176 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:05,176 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-02 22:48:05,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 22:48:05,177 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:05,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:05,177 INFO L85 PathProgramCache]: Analyzing trace with hash 646966847, now seen corresponding path program 1 times [2021-11-02 22:48:05,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:05,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945315145] [2021-11-02 22:48:05,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:05,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:05,271 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-02 22:48:05,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:05,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945315145] [2021-11-02 22:48:05,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945315145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:05,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:05,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:05,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220515744] [2021-11-02 22:48:05,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:05,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:05,273 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-02 22:48:07,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:07,667 INFO L93 Difference]: Finished difference Result 338 states and 512 transitions. [2021-11-02 22:48:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:07,668 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-02 22:48:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:07,669 INFO L225 Difference]: With dead ends: 338 [2021-11-02 22:48:07,670 INFO L226 Difference]: Without dead ends: 189 [2021-11-02 22:48:07,670 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-02 22:48:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-11-02 22:48:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2021-11-02 22:48:07,677 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-02 22:48:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 255 transitions. [2021-11-02 22:48:07,678 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 255 transitions. Word has length 68 [2021-11-02 22:48:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:07,679 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 255 transitions. [2021-11-02 22:48:07,679 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-02 22:48:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2021-11-02 22:48:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-02 22:48:07,680 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:07,681 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-02 22:48:07,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 22:48:07,681 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:07,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:07,682 INFO L85 PathProgramCache]: Analyzing trace with hash 106821375, now seen corresponding path program 1 times [2021-11-02 22:48:07,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:07,682 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18613729] [2021-11-02 22:48:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:07,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:07,773 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-02 22:48:07,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:07,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18613729] [2021-11-02 22:48:07,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18613729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:07,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:07,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:07,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563149134] [2021-11-02 22:48:07,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:07,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:07,777 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-02 22:48:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:10,142 INFO L93 Difference]: Finished difference Result 336 states and 508 transitions. [2021-11-02 22:48:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:10,143 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-02 22:48:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:10,145 INFO L225 Difference]: With dead ends: 336 [2021-11-02 22:48:10,145 INFO L226 Difference]: Without dead ends: 187 [2021-11-02 22:48:10,146 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-02 22:48:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-02 22:48:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2021-11-02 22:48:10,152 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-02 22:48:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2021-11-02 22:48:10,154 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 68 [2021-11-02 22:48:10,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:10,154 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2021-11-02 22:48:10,154 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-02 22:48:10,155 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2021-11-02 22:48:10,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 22:48:10,156 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:10,156 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-02 22:48:10,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 22:48:10,157 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:10,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1368291338, now seen corresponding path program 1 times [2021-11-02 22:48:10,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:10,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914382733] [2021-11-02 22:48:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:10,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:10,251 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-02 22:48:10,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:10,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914382733] [2021-11-02 22:48:10,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914382733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:10,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:10,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:10,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491414227] [2021-11-02 22:48:10,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:10,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:10,259 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-02 22:48:12,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:12,026 INFO L93 Difference]: Finished difference Result 336 states and 506 transitions. [2021-11-02 22:48:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:12,027 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-02 22:48:12,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:12,029 INFO L225 Difference]: With dead ends: 336 [2021-11-02 22:48:12,029 INFO L226 Difference]: Without dead ends: 187 [2021-11-02 22:48:12,030 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-02 22:48:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-02 22:48:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2021-11-02 22:48:12,036 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-02 22:48:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2021-11-02 22:48:12,038 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 69 [2021-11-02 22:48:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:12,038 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2021-11-02 22:48:12,039 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-02 22:48:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2021-11-02 22:48:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-02 22:48:12,040 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:12,041 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-02 22:48:12,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 22:48:12,041 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1538738963, now seen corresponding path program 1 times [2021-11-02 22:48:12,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:12,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141894241] [2021-11-02 22:48:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:12,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:12,118 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-02 22:48:12,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:12,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141894241] [2021-11-02 22:48:12,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141894241] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:12,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:12,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:12,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822268937] [2021-11-02 22:48:12,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:12,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:12,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:12,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:12,122 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-02 22:48:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:13,804 INFO L93 Difference]: Finished difference Result 336 states and 504 transitions. [2021-11-02 22:48:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:13,805 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-02 22:48:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:13,807 INFO L225 Difference]: With dead ends: 336 [2021-11-02 22:48:13,807 INFO L226 Difference]: Without dead ends: 187 [2021-11-02 22:48:13,808 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-02 22:48:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-11-02 22:48:13,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2021-11-02 22:48:13,814 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-02 22:48:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2021-11-02 22:48:13,815 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 70 [2021-11-02 22:48:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:13,816 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2021-11-02 22:48:13,816 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-02 22:48:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2021-11-02 22:48:13,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-02 22:48:13,818 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:13,818 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-02 22:48:13,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 22:48:13,819 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1780815697, now seen corresponding path program 1 times [2021-11-02 22:48:13,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:13,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142995054] [2021-11-02 22:48:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:13,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:13,891 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-02 22:48:13,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:13,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142995054] [2021-11-02 22:48:13,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142995054] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:13,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:13,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:13,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959976503] [2021-11-02 22:48:13,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:13,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:13,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:13,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:13,894 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-02 22:48:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:15,692 INFO L93 Difference]: Finished difference Result 326 states and 489 transitions. [2021-11-02 22:48:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:15,693 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-02 22:48:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:15,694 INFO L225 Difference]: With dead ends: 326 [2021-11-02 22:48:15,694 INFO L226 Difference]: Without dead ends: 177 [2021-11-02 22:48:15,695 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-02 22:48:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-02 22:48:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2021-11-02 22:48:15,701 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-02 22:48:15,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2021-11-02 22:48:15,703 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 71 [2021-11-02 22:48:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:15,703 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2021-11-02 22:48:15,703 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-02 22:48:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2021-11-02 22:48:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-02 22:48:15,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:15,705 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-02 22:48:15,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 22:48:15,705 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:15,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:15,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2072838766, now seen corresponding path program 1 times [2021-11-02 22:48:15,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:15,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714871309] [2021-11-02 22:48:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:15,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:15,821 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-02 22:48:15,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:15,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714871309] [2021-11-02 22:48:15,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714871309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:15,822 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:15,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:15,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994048658] [2021-11-02 22:48:15,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:15,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:15,826 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-02 22:48:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:18,392 INFO L93 Difference]: Finished difference Result 426 states and 642 transitions. [2021-11-02 22:48:18,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:18,393 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-02 22:48:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:18,395 INFO L225 Difference]: With dead ends: 426 [2021-11-02 22:48:18,395 INFO L226 Difference]: Without dead ends: 277 [2021-11-02 22:48:18,396 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-02 22:48:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-02 22:48:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 200. [2021-11-02 22:48:18,404 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-02 22:48:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 303 transitions. [2021-11-02 22:48:18,405 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 303 transitions. Word has length 76 [2021-11-02 22:48:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:18,406 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 303 transitions. [2021-11-02 22:48:18,406 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-02 22:48:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 303 transitions. [2021-11-02 22:48:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-02 22:48:18,408 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:18,408 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-02 22:48:18,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 22:48:18,409 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2000452208, now seen corresponding path program 1 times [2021-11-02 22:48:18,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:18,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084961327] [2021-11-02 22:48:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:18,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:18,496 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-02 22:48:18,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:18,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084961327] [2021-11-02 22:48:18,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084961327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:18,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:18,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:18,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372453103] [2021-11-02 22:48:18,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:18,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:18,499 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-02 22:48:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:20,905 INFO L93 Difference]: Finished difference Result 429 states and 658 transitions. [2021-11-02 22:48:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:20,906 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-02 22:48:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:20,908 INFO L225 Difference]: With dead ends: 429 [2021-11-02 22:48:20,908 INFO L226 Difference]: Without dead ends: 250 [2021-11-02 22:48:20,909 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-02 22:48:20,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-02 22:48:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 224. [2021-11-02 22:48:20,916 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-02 22:48:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 345 transitions. [2021-11-02 22:48:20,918 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 345 transitions. Word has length 76 [2021-11-02 22:48:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:20,918 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 345 transitions. [2021-11-02 22:48:20,919 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-02 22:48:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 345 transitions. [2021-11-02 22:48:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-02 22:48:20,920 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:20,921 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-02 22:48:20,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 22:48:20,921 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2072837020, now seen corresponding path program 1 times [2021-11-02 22:48:20,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:20,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385864048] [2021-11-02 22:48:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:20,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:21,034 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-02 22:48:21,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:21,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385864048] [2021-11-02 22:48:21,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385864048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:21,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:21,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:21,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128817275] [2021-11-02 22:48:21,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:21,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:21,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:21,039 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-02 22:48:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:23,320 INFO L93 Difference]: Finished difference Result 496 states and 764 transitions. [2021-11-02 22:48:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:23,321 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-02 22:48:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:23,324 INFO L225 Difference]: With dead ends: 496 [2021-11-02 22:48:23,324 INFO L226 Difference]: Without dead ends: 293 [2021-11-02 22:48:23,325 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-02 22:48:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-02 22:48:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 225. [2021-11-02 22:48:23,334 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-02 22:48:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 346 transitions. [2021-11-02 22:48:23,336 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 346 transitions. Word has length 77 [2021-11-02 22:48:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:23,336 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 346 transitions. [2021-11-02 22:48:23,337 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-02 22:48:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 346 transitions. [2021-11-02 22:48:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-02 22:48:23,338 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:23,339 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-02 22:48:23,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 22:48:23,339 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 240748658, now seen corresponding path program 1 times [2021-11-02 22:48:23,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:23,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722968803] [2021-11-02 22:48:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:23,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:23,431 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-02 22:48:23,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:23,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722968803] [2021-11-02 22:48:23,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722968803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:23,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:23,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:23,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032836065] [2021-11-02 22:48:23,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:23,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:23,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:23,435 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-02 22:48:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:25,870 INFO L93 Difference]: Finished difference Result 497 states and 764 transitions. [2021-11-02 22:48:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:25,871 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-02 22:48:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:25,874 INFO L225 Difference]: With dead ends: 497 [2021-11-02 22:48:25,874 INFO L226 Difference]: Without dead ends: 293 [2021-11-02 22:48:25,875 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-02 22:48:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-02 22:48:25,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 235. [2021-11-02 22:48:25,884 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-02 22:48:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 365 transitions. [2021-11-02 22:48:25,885 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 365 transitions. Word has length 83 [2021-11-02 22:48:25,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:25,886 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 365 transitions. [2021-11-02 22:48:25,886 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-02 22:48:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 365 transitions. [2021-11-02 22:48:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-02 22:48:25,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:25,889 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-02 22:48:25,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 22:48:25,889 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:25,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1344832479, now seen corresponding path program 1 times [2021-11-02 22:48:25,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:25,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838297557] [2021-11-02 22:48:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:25,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:25,985 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-02 22:48:25,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:25,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838297557] [2021-11-02 22:48:25,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838297557] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:25,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:25,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:25,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841785599] [2021-11-02 22:48:25,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:25,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:25,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:25,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:25,989 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-02 22:48:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:28,398 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2021-11-02 22:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:28,399 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-02 22:48:28,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:28,401 INFO L225 Difference]: With dead ends: 499 [2021-11-02 22:48:28,402 INFO L226 Difference]: Without dead ends: 285 [2021-11-02 22:48:28,402 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-02 22:48:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-02 22:48:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 236. [2021-11-02 22:48:28,411 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-02 22:48:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 366 transitions. [2021-11-02 22:48:28,412 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 366 transitions. Word has length 84 [2021-11-02 22:48:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:28,413 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 366 transitions. [2021-11-02 22:48:28,413 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-02 22:48:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 366 transitions. [2021-11-02 22:48:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-02 22:48:28,415 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:28,415 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-02 22:48:28,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 22:48:28,416 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash -523718805, now seen corresponding path program 1 times [2021-11-02 22:48:28,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:28,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166701185] [2021-11-02 22:48:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:28,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:28,499 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-02 22:48:28,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:28,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166701185] [2021-11-02 22:48:28,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166701185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:28,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:28,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:28,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761467196] [2021-11-02 22:48:28,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:28,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:28,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:28,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:28,502 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-02 22:48:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:30,071 INFO L93 Difference]: Finished difference Result 500 states and 771 transitions. [2021-11-02 22:48:30,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:30,071 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-02 22:48:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:30,074 INFO L225 Difference]: With dead ends: 500 [2021-11-02 22:48:30,074 INFO L226 Difference]: Without dead ends: 285 [2021-11-02 22:48:30,075 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-02 22:48:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-11-02 22:48:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 236. [2021-11-02 22:48:30,083 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-02 22:48:30,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 365 transitions. [2021-11-02 22:48:30,085 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 365 transitions. Word has length 89 [2021-11-02 22:48:30,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:30,085 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 365 transitions. [2021-11-02 22:48:30,086 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-02 22:48:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 365 transitions. [2021-11-02 22:48:30,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-02 22:48:30,087 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:30,088 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-02 22:48:30,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 22:48:30,088 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1404553897, now seen corresponding path program 1 times [2021-11-02 22:48:30,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:30,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782763562] [2021-11-02 22:48:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:30,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:30,175 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-02 22:48:30,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:30,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782763562] [2021-11-02 22:48:30,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782763562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:30,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:30,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:30,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695604004] [2021-11-02 22:48:30,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:30,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:30,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:30,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:30,178 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-02 22:48:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:32,551 INFO L93 Difference]: Finished difference Result 477 states and 739 transitions. [2021-11-02 22:48:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:32,552 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-02 22:48:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:32,554 INFO L225 Difference]: With dead ends: 477 [2021-11-02 22:48:32,555 INFO L226 Difference]: Without dead ends: 262 [2021-11-02 22:48:32,555 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-02 22:48:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-02 22:48:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2021-11-02 22:48:32,564 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-02 22:48:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2021-11-02 22:48:32,565 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 89 [2021-11-02 22:48:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:32,566 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2021-11-02 22:48:32,566 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-02 22:48:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2021-11-02 22:48:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 22:48:32,568 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:32,568 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-02 22:48:32,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 22:48:32,568 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:32,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 557786570, now seen corresponding path program 1 times [2021-11-02 22:48:32,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:32,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903752703] [2021-11-02 22:48:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:32,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:32,687 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-02 22:48:32,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:32,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903752703] [2021-11-02 22:48:32,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903752703] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:32,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:32,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:32,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326308393] [2021-11-02 22:48:32,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:32,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:32,692 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-02 22:48:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:34,174 INFO L93 Difference]: Finished difference Result 499 states and 766 transitions. [2021-11-02 22:48:34,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:34,175 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-02 22:48:34,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:34,177 INFO L225 Difference]: With dead ends: 499 [2021-11-02 22:48:34,177 INFO L226 Difference]: Without dead ends: 284 [2021-11-02 22:48:34,183 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-02 22:48:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-02 22:48:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2021-11-02 22:48:34,192 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-02 22:48:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 363 transitions. [2021-11-02 22:48:34,193 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 363 transitions. Word has length 90 [2021-11-02 22:48:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:34,194 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 363 transitions. [2021-11-02 22:48:34,194 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-02 22:48:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 363 transitions. [2021-11-02 22:48:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 22:48:34,196 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:34,196 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-02 22:48:34,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-02 22:48:34,197 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:34,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1423365726, now seen corresponding path program 1 times [2021-11-02 22:48:34,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:34,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266078651] [2021-11-02 22:48:34,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:34,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:34,343 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-02 22:48:34,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:34,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266078651] [2021-11-02 22:48:34,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266078651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:34,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:34,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:48:34,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666723316] [2021-11-02 22:48:34,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:48:34,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:48:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:48:34,346 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-02 22:48:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:37,672 INFO L93 Difference]: Finished difference Result 472 states and 731 transitions. [2021-11-02 22:48:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:48:37,673 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-02 22:48:37,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:37,674 INFO L225 Difference]: With dead ends: 472 [2021-11-02 22:48:37,674 INFO L226 Difference]: Without dead ends: 257 [2021-11-02 22:48:37,675 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-02 22:48:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-11-02 22:48:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2021-11-02 22:48:37,683 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-02 22:48:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2021-11-02 22:48:37,684 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 90 [2021-11-02 22:48:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:37,685 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2021-11-02 22:48:37,685 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-02 22:48:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2021-11-02 22:48:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 22:48:37,687 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:37,687 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-02 22:48:37,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-02 22:48:37,688 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1034180661, now seen corresponding path program 1 times [2021-11-02 22:48:37,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:37,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268797770] [2021-11-02 22:48:37,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:37,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:37,768 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-02 22:48:37,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:37,769 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268797770] [2021-11-02 22:48:37,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268797770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:37,769 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:37,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:37,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350158072] [2021-11-02 22:48:37,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:37,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:37,772 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-02 22:48:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:40,275 INFO L93 Difference]: Finished difference Result 538 states and 814 transitions. [2021-11-02 22:48:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:40,276 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-02 22:48:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:40,278 INFO L225 Difference]: With dead ends: 538 [2021-11-02 22:48:40,278 INFO L226 Difference]: Without dead ends: 303 [2021-11-02 22:48:40,279 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-02 22:48:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-11-02 22:48:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2021-11-02 22:48:40,288 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-02 22:48:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2021-11-02 22:48:40,289 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 90 [2021-11-02 22:48:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:40,289 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2021-11-02 22:48:40,290 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-02 22:48:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2021-11-02 22:48:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 22:48:40,291 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:40,292 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-02 22:48:40,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-02 22:48:40,292 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash 494035189, now seen corresponding path program 1 times [2021-11-02 22:48:40,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:40,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018842478] [2021-11-02 22:48:40,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:40,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:40,377 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-02 22:48:40,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:40,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018842478] [2021-11-02 22:48:40,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018842478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:40,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:40,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:40,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927164535] [2021-11-02 22:48:40,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:40,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:40,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:40,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:40,381 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-02 22:48:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:42,239 INFO L93 Difference]: Finished difference Result 536 states and 810 transitions. [2021-11-02 22:48:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:42,240 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-02 22:48:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:42,242 INFO L225 Difference]: With dead ends: 536 [2021-11-02 22:48:42,242 INFO L226 Difference]: Without dead ends: 301 [2021-11-02 22:48:42,243 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-02 22:48:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-02 22:48:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-02 22:48:42,250 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-02 22:48:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2021-11-02 22:48:42,251 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 90 [2021-11-02 22:48:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:42,251 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2021-11-02 22:48:42,251 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-02 22:48:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2021-11-02 22:48:42,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 22:48:42,253 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:42,253 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-02 22:48:42,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 22:48:42,254 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash 681092279, now seen corresponding path program 1 times [2021-11-02 22:48:42,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:42,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682663009] [2021-11-02 22:48:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:42,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:42,331 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-02 22:48:42,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:42,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682663009] [2021-11-02 22:48:42,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682663009] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:42,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:42,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:42,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532457584] [2021-11-02 22:48:42,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:42,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:42,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:42,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:42,334 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-02 22:48:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:44,726 INFO L93 Difference]: Finished difference Result 515 states and 780 transitions. [2021-11-02 22:48:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:44,728 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-02 22:48:44,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:44,730 INFO L225 Difference]: With dead ends: 515 [2021-11-02 22:48:44,730 INFO L226 Difference]: Without dead ends: 280 [2021-11-02 22:48:44,731 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-02 22:48:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-11-02 22:48:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 256. [2021-11-02 22:48:44,738 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-02 22:48:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2021-11-02 22:48:44,739 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 90 [2021-11-02 22:48:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:44,739 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2021-11-02 22:48:44,739 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-02 22:48:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2021-11-02 22:48:44,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-02 22:48:44,741 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:44,741 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-02 22:48:44,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-02 22:48:44,742 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 140946807, now seen corresponding path program 1 times [2021-11-02 22:48:44,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:44,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171595716] [2021-11-02 22:48:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:44,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:44,811 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-02 22:48:44,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:44,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171595716] [2021-11-02 22:48:44,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171595716] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:44,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:44,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:44,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596768270] [2021-11-02 22:48:44,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:44,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:44,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:44,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:44,814 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-02 22:48:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:47,132 INFO L93 Difference]: Finished difference Result 513 states and 776 transitions. [2021-11-02 22:48:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:47,132 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-02 22:48:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:47,134 INFO L225 Difference]: With dead ends: 513 [2021-11-02 22:48:47,135 INFO L226 Difference]: Without dead ends: 278 [2021-11-02 22:48:47,135 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-02 22:48:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-02 22:48:47,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-02 22:48:47,143 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-02 22:48:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2021-11-02 22:48:47,144 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 90 [2021-11-02 22:48:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:47,145 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2021-11-02 22:48:47,145 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-02 22:48:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2021-11-02 22:48:47,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-02 22:48:47,146 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:47,147 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-02 22:48:47,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-02 22:48:47,147 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:47,148 INFO L85 PathProgramCache]: Analyzing trace with hash 618167687, now seen corresponding path program 1 times [2021-11-02 22:48:47,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:47,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489486823] [2021-11-02 22:48:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:47,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:47,213 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-02 22:48:47,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:47,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489486823] [2021-11-02 22:48:47,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489486823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:47,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:47,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:47,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184827047] [2021-11-02 22:48:47,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:47,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:47,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:47,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:47,216 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-02 22:48:49,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:49,637 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2021-11-02 22:48:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:49,638 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-02 22:48:49,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:49,640 INFO L225 Difference]: With dead ends: 536 [2021-11-02 22:48:49,640 INFO L226 Difference]: Without dead ends: 301 [2021-11-02 22:48:49,640 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-02 22:48:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-02 22:48:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-02 22:48:49,650 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-02 22:48:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2021-11-02 22:48:49,652 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 91 [2021-11-02 22:48:49,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:49,652 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2021-11-02 22:48:49,653 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-02 22:48:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2021-11-02 22:48:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-02 22:48:49,654 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:49,654 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-02 22:48:49,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-02 22:48:49,655 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1737637563, now seen corresponding path program 1 times [2021-11-02 22:48:49,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:49,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712860197] [2021-11-02 22:48:49,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:49,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:49,754 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-02 22:48:49,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:49,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712860197] [2021-11-02 22:48:49,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712860197] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:49,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:49,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:49,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328499410] [2021-11-02 22:48:49,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:49,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:49,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:49,759 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-02 22:48:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:50,917 INFO L93 Difference]: Finished difference Result 513 states and 772 transitions. [2021-11-02 22:48:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:50,917 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-02 22:48:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:50,919 INFO L225 Difference]: With dead ends: 513 [2021-11-02 22:48:50,919 INFO L226 Difference]: Without dead ends: 278 [2021-11-02 22:48:50,920 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-02 22:48:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-02 22:48:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-02 22:48:50,930 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-02 22:48:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2021-11-02 22:48:50,932 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 91 [2021-11-02 22:48:50,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:50,933 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2021-11-02 22:48:50,933 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-02 22:48:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2021-11-02 22:48:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-02 22:48:50,934 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:50,935 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-02 22:48:50,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-02 22:48:50,935 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1656149457, now seen corresponding path program 1 times [2021-11-02 22:48:50,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:50,936 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502628226] [2021-11-02 22:48:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:50,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:51,009 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-02 22:48:51,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:51,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502628226] [2021-11-02 22:48:51,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502628226] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:51,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:51,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:51,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69432297] [2021-11-02 22:48:51,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:51,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:51,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:51,013 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-02 22:48:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:53,498 INFO L93 Difference]: Finished difference Result 536 states and 800 transitions. [2021-11-02 22:48:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:53,500 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-02 22:48:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:53,503 INFO L225 Difference]: With dead ends: 536 [2021-11-02 22:48:53,503 INFO L226 Difference]: Without dead ends: 301 [2021-11-02 22:48:53,505 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-02 22:48:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-02 22:48:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-02 22:48:53,515 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-02 22:48:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2021-11-02 22:48:53,517 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 92 [2021-11-02 22:48:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:53,518 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2021-11-02 22:48:53,518 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-02 22:48:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2021-11-02 22:48:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-02 22:48:53,519 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:53,520 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-02 22:48:53,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-02 22:48:53,520 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:53,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1640630739, now seen corresponding path program 1 times [2021-11-02 22:48:53,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:53,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323312722] [2021-11-02 22:48:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:53,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:53,603 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-02 22:48:53,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:53,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323312722] [2021-11-02 22:48:53,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323312722] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:53,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:53,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:53,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961363178] [2021-11-02 22:48:53,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:53,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:53,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:53,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:53,606 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-02 22:48:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:56,001 INFO L93 Difference]: Finished difference Result 513 states and 768 transitions. [2021-11-02 22:48:56,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:56,002 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-02 22:48:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:56,005 INFO L225 Difference]: With dead ends: 513 [2021-11-02 22:48:56,005 INFO L226 Difference]: Without dead ends: 278 [2021-11-02 22:48:56,006 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-02 22:48:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-02 22:48:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-02 22:48:56,015 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-02 22:48:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2021-11-02 22:48:56,016 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 92 [2021-11-02 22:48:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:56,017 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2021-11-02 22:48:56,017 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-02 22:48:56,017 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2021-11-02 22:48:56,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-02 22:48:56,018 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:56,018 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-02 22:48:56,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-02 22:48:56,019 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1808188638, now seen corresponding path program 1 times [2021-11-02 22:48:56,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:56,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466921591] [2021-11-02 22:48:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:56,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:56,095 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-02 22:48:56,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:56,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466921591] [2021-11-02 22:48:56,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466921591] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:56,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:56,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:56,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005047174] [2021-11-02 22:48:56,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:56,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:56,098 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-02 22:48:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:48:58,580 INFO L93 Difference]: Finished difference Result 536 states and 796 transitions. [2021-11-02 22:48:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:48:58,581 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-02 22:48:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:48:58,583 INFO L225 Difference]: With dead ends: 536 [2021-11-02 22:48:58,583 INFO L226 Difference]: Without dead ends: 301 [2021-11-02 22:48:58,583 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-02 22:48:58,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-11-02 22:48:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2021-11-02 22:48:58,592 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-02 22:48:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2021-11-02 22:48:58,593 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 93 [2021-11-02 22:48:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:48:58,594 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2021-11-02 22:48:58,594 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-02 22:48:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2021-11-02 22:48:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-02 22:48:58,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:48:58,595 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-02 22:48:58,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-02 22:48:58,596 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:48:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:48:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2005698400, now seen corresponding path program 1 times [2021-11-02 22:48:58,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:48:58,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326991433] [2021-11-02 22:48:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:48:58,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:48:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:48:58,667 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-02 22:48:58,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:48:58,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326991433] [2021-11-02 22:48:58,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326991433] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:48:58,669 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:48:58,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:48:58,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285419863] [2021-11-02 22:48:58,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:48:58,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:48:58,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:48:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:48:58,671 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-02 22:49:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:01,025 INFO L93 Difference]: Finished difference Result 513 states and 764 transitions. [2021-11-02 22:49:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:01,028 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-02 22:49:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:01,030 INFO L225 Difference]: With dead ends: 513 [2021-11-02 22:49:01,030 INFO L226 Difference]: Without dead ends: 278 [2021-11-02 22:49:01,031 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-02 22:49:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-02 22:49:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2021-11-02 22:49:01,039 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-02 22:49:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2021-11-02 22:49:01,040 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 93 [2021-11-02 22:49:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:01,041 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2021-11-02 22:49:01,042 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-02 22:49:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2021-11-02 22:49:01,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-02 22:49:01,043 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:01,043 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-02 22:49:01,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-02 22:49:01,044 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:01,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1184445516, now seen corresponding path program 1 times [2021-11-02 22:49:01,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:01,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969786491] [2021-11-02 22:49:01,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:01,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:01,136 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-02 22:49:01,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:01,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969786491] [2021-11-02 22:49:01,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969786491] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:01,137 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:01,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:49:01,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402151333] [2021-11-02 22:49:01,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:49:01,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:01,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:49:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:49:01,140 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-02 22:49:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:03,017 INFO L93 Difference]: Finished difference Result 526 states and 780 transitions. [2021-11-02 22:49:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:03,018 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-02 22:49:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:03,020 INFO L225 Difference]: With dead ends: 526 [2021-11-02 22:49:03,020 INFO L226 Difference]: Without dead ends: 291 [2021-11-02 22:49:03,021 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-02 22:49:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-02 22:49:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 256. [2021-11-02 22:49:03,029 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-02 22:49:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 378 transitions. [2021-11-02 22:49:03,031 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 378 transitions. Word has length 94 [2021-11-02 22:49:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:03,031 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 378 transitions. [2021-11-02 22:49:03,031 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-02 22:49:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 378 transitions. [2021-11-02 22:49:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-02 22:49:03,033 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:03,033 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-02 22:49:03,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-02 22:49:03,033 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -844140594, now seen corresponding path program 1 times [2021-11-02 22:49:03,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:03,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122277352] [2021-11-02 22:49:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:03,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:03,105 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-02 22:49:03,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:03,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122277352] [2021-11-02 22:49:03,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122277352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:03,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:03,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:49:03,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647752451] [2021-11-02 22:49:03,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:49:03,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:03,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:49:03,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:49:03,108 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-02 22:49:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:05,396 INFO L93 Difference]: Finished difference Result 503 states and 748 transitions. [2021-11-02 22:49:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:05,397 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-02 22:49:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:05,398 INFO L225 Difference]: With dead ends: 503 [2021-11-02 22:49:05,398 INFO L226 Difference]: Without dead ends: 268 [2021-11-02 22:49:05,399 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-02 22:49:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-02 22:49:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2021-11-02 22:49:05,407 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-02 22:49:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 377 transitions. [2021-11-02 22:49:05,408 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 377 transitions. Word has length 94 [2021-11-02 22:49:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:05,408 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 377 transitions. [2021-11-02 22:49:05,409 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-02 22:49:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 377 transitions. [2021-11-02 22:49:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-02 22:49:05,410 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:05,410 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-02 22:49:05,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-02 22:49:05,411 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:05,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:05,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1986994926, now seen corresponding path program 1 times [2021-11-02 22:49:05,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:05,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081376826] [2021-11-02 22:49:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:05,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:05,499 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-02 22:49:05,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:05,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081376826] [2021-11-02 22:49:05,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081376826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:05,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:05,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 22:49:05,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372733332] [2021-11-02 22:49:05,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:49:05,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:05,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:49:05,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:49:05,502 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-02 22:49:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:07,907 INFO L93 Difference]: Finished difference Result 526 states and 776 transitions. [2021-11-02 22:49:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:07,908 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-02 22:49:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:07,910 INFO L225 Difference]: With dead ends: 526 [2021-11-02 22:49:07,910 INFO L226 Difference]: Without dead ends: 291 [2021-11-02 22:49:07,910 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-02 22:49:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-02 22:49:07,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 256. [2021-11-02 22:49:07,921 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-02 22:49:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 376 transitions. [2021-11-02 22:49:07,922 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 376 transitions. Word has length 98 [2021-11-02 22:49:07,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:07,923 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 376 transitions. [2021-11-02 22:49:07,923 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-02 22:49:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 376 transitions. [2021-11-02 22:49:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-02 22:49:07,924 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:07,925 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-02 22:49:07,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-02 22:49:07,926 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:07,927 INFO L85 PathProgramCache]: Analyzing trace with hash -600209516, now seen corresponding path program 1 times [2021-11-02 22:49:07,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:07,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795491967] [2021-11-02 22:49:07,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:07,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:08,026 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-02 22:49:08,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:08,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795491967] [2021-11-02 22:49:08,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795491967] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:08,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:08,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:49:08,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401993730] [2021-11-02 22:49:08,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:49:08,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:49:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:49:08,029 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-02 22:49:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:08,096 INFO L93 Difference]: Finished difference Result 721 states and 1074 transitions. [2021-11-02 22:49:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:49:08,097 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-02 22:49:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:08,101 INFO L225 Difference]: With dead ends: 721 [2021-11-02 22:49:08,101 INFO L226 Difference]: Without dead ends: 486 [2021-11-02 22:49:08,102 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-02 22:49:08,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-11-02 22:49:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2021-11-02 22:49:08,118 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-02 22:49:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 713 transitions. [2021-11-02 22:49:08,120 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 713 transitions. Word has length 98 [2021-11-02 22:49:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:08,121 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 713 transitions. [2021-11-02 22:49:08,121 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-02 22:49:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 713 transitions. [2021-11-02 22:49:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-02 22:49:08,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:08,123 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-02 22:49:08,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-02 22:49:08,124 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash 660707734, now seen corresponding path program 1 times [2021-11-02 22:49:08,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:08,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414465560] [2021-11-02 22:49:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:08,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:08,186 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-02 22:49:08,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:08,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414465560] [2021-11-02 22:49:08,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414465560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:08,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:08,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:49:08,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666939737] [2021-11-02 22:49:08,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:49:08,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:49:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:49:08,189 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-02 22:49:08,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:08,232 INFO L93 Difference]: Finished difference Result 978 states and 1438 transitions. [2021-11-02 22:49:08,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:49:08,233 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-02 22:49:08,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:08,236 INFO L225 Difference]: With dead ends: 978 [2021-11-02 22:49:08,236 INFO L226 Difference]: Without dead ends: 513 [2021-11-02 22:49:08,237 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-02 22:49:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-02 22:49:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2021-11-02 22:49:08,255 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-02 22:49:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 748 transitions. [2021-11-02 22:49:08,257 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 748 transitions. Word has length 98 [2021-11-02 22:49:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:08,258 INFO L470 AbstractCegarLoop]: Abstraction has 513 states and 748 transitions. [2021-11-02 22:49:08,258 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-02 22:49:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 748 transitions. [2021-11-02 22:49:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-02 22:49:08,260 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:08,260 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-02 22:49:08,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-02 22:49:08,261 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:08,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash 687773336, now seen corresponding path program 1 times [2021-11-02 22:49:08,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:08,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587378237] [2021-11-02 22:49:08,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:08,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:08,314 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-02 22:49:08,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:08,317 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587378237] [2021-11-02 22:49:08,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587378237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:08,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:08,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:49:08,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050512251] [2021-11-02 22:49:08,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:49:08,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:08,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:49:08,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:49:08,320 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-02 22:49:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:08,360 INFO L93 Difference]: Finished difference Result 1007 states and 1474 transitions. [2021-11-02 22:49:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:49:08,361 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-02 22:49:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:08,365 INFO L225 Difference]: With dead ends: 1007 [2021-11-02 22:49:08,365 INFO L226 Difference]: Without dead ends: 515 [2021-11-02 22:49:08,367 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-02 22:49:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-11-02 22:49:08,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2021-11-02 22:49:08,404 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-02 22:49:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 750 transitions. [2021-11-02 22:49:08,406 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 750 transitions. Word has length 98 [2021-11-02 22:49:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:08,408 INFO L470 AbstractCegarLoop]: Abstraction has 515 states and 750 transitions. [2021-11-02 22:49:08,408 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-02 22:49:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 750 transitions. [2021-11-02 22:49:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-02 22:49:08,411 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:08,411 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-02 22:49:08,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-02 22:49:08,411 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1575564738, now seen corresponding path program 1 times [2021-11-02 22:49:08,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:08,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373768042] [2021-11-02 22:49:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:08,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:08,493 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-02 22:49:08,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:08,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373768042] [2021-11-02 22:49:08,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373768042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:08,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:08,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:49:08,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833009950] [2021-11-02 22:49:08,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:49:08,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:49:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:49:08,496 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-02 22:49:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:08,564 INFO L93 Difference]: Finished difference Result 1242 states and 1824 transitions. [2021-11-02 22:49:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:49:08,565 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-02 22:49:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:08,570 INFO L225 Difference]: With dead ends: 1242 [2021-11-02 22:49:08,570 INFO L226 Difference]: Without dead ends: 750 [2021-11-02 22:49:08,571 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-02 22:49:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2021-11-02 22:49:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2021-11-02 22:49:08,598 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-02 22:49:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1098 transitions. [2021-11-02 22:49:08,600 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1098 transitions. Word has length 100 [2021-11-02 22:49:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:08,601 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1098 transitions. [2021-11-02 22:49:08,601 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-02 22:49:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1098 transitions. [2021-11-02 22:49:08,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-02 22:49:08,603 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:08,604 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-02 22:49:08,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-02 22:49:08,604 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:08,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1668917598, now seen corresponding path program 1 times [2021-11-02 22:49:08,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:08,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616367524] [2021-11-02 22:49:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:08,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:08,685 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-02 22:49:08,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:08,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616367524] [2021-11-02 22:49:08,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616367524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:08,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:08,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:49:08,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75189322] [2021-11-02 22:49:08,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:49:08,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:08,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:49:08,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:49:08,688 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-02 22:49:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:08,766 INFO L93 Difference]: Finished difference Result 1708 states and 2518 transitions. [2021-11-02 22:49:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:49:08,766 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-02 22:49:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:08,773 INFO L225 Difference]: With dead ends: 1708 [2021-11-02 22:49:08,773 INFO L226 Difference]: Without dead ends: 983 [2021-11-02 22:49:08,775 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-02 22:49:08,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-11-02 22:49:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 981. [2021-11-02 22:49:08,809 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-02 22:49:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1432 transitions. [2021-11-02 22:49:08,813 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1432 transitions. Word has length 107 [2021-11-02 22:49:08,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:08,813 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1432 transitions. [2021-11-02 22:49:08,814 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-02 22:49:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1432 transitions. [2021-11-02 22:49:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-02 22:49:08,817 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:08,817 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-02 22:49:08,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-02 22:49:08,818 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:08,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:08,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1034789415, now seen corresponding path program 1 times [2021-11-02 22:49:08,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:08,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815840711] [2021-11-02 22:49:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:08,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:08,920 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-02 22:49:08,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:08,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815840711] [2021-11-02 22:49:08,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815840711] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:08,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:08,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 22:49:08,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649751555] [2021-11-02 22:49:08,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 22:49:08,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:08,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 22:49:08,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 22:49:08,923 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-02 22:49:09,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:09,002 INFO L93 Difference]: Finished difference Result 2172 states and 3185 transitions. [2021-11-02 22:49:09,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 22:49:09,002 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-02 22:49:09,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:09,010 INFO L225 Difference]: With dead ends: 2172 [2021-11-02 22:49:09,010 INFO L226 Difference]: Without dead ends: 1214 [2021-11-02 22:49:09,012 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-02 22:49:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-11-02 22:49:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2021-11-02 22:49:09,053 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-02 22:49:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1777 transitions. [2021-11-02 22:49:09,057 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1777 transitions. Word has length 124 [2021-11-02 22:49:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:09,057 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1777 transitions. [2021-11-02 22:49:09,057 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-02 22:49:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1777 transitions. [2021-11-02 22:49:09,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-02 22:49:09,061 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:09,061 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-02 22:49:09,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-11-02 22:49:09,061 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:09,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1329906676, now seen corresponding path program 1 times [2021-11-02 22:49:09,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:09,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41306542] [2021-11-02 22:49:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:09,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:09,414 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-02 22:49:09,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:49:09,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41306542] [2021-11-02 22:49:09,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41306542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:09,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:09,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:49:09,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882403327] [2021-11-02 22:49:09,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:49:09,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:49:09,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:49:09,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:49:09,417 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-02 22:49:11,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:11,378 INFO L93 Difference]: Finished difference Result 2425 states and 3550 transitions. [2021-11-02 22:49:11,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:49:11,379 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-02 22:49:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:11,387 INFO L225 Difference]: With dead ends: 2425 [2021-11-02 22:49:11,388 INFO L226 Difference]: Without dead ends: 1214 [2021-11-02 22:49:11,390 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-02 22:49:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-11-02 22:49:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2021-11-02 22:49:11,433 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-02 22:49:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1776 transitions. [2021-11-02 22:49:11,437 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1776 transitions. Word has length 129 [2021-11-02 22:49:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:11,437 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 1776 transitions. [2021-11-02 22:49:11,438 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-02 22:49:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1776 transitions. [2021-11-02 22:49:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-02 22:49:11,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:11,441 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-02 22:49:11,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-02 22:49:11,442 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2021-11-02 22:49:11,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:49:11,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902651746] [2021-11-02 22:49:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:11,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:49:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:49:12,181 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:49:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:49:12,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:49:12,769 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:49:12,770 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 22:49:12,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-02 22:49:12,777 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-02 22:49:12,781 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:49:12,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:49:12 BoogieIcfgContainer [2021-11-02 22:49:12,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:49:12,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:49:12,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:49:12,947 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:49:12,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:47:33" (3/4) ... [2021-11-02 22:49:12,951 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 22:49:12,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:49:12,953 INFO L168 Benchmark]: Toolchain (without parser) took 102587.96 ms. Allocated memory was 96.5 MB in the beginning and 155.2 MB in the end (delta: 58.7 MB). Free memory was 73.7 MB in the beginning and 71.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 61.6 MB. Max. memory is 16.1 GB. [2021-11-02 22:49:12,954 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 79.7 MB. Free memory is still 53.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:49:12,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 913.56 ms. Allocated memory is still 96.5 MB. Free memory was 73.5 MB in the beginning and 44.1 MB in the end (delta: 29.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:49:12,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 155.62 ms. Allocated memory is still 96.5 MB. Free memory was 44.1 MB in the beginning and 70.0 MB in the end (delta: -25.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. [2021-11-02 22:49:12,955 INFO L168 Benchmark]: Boogie Preprocessor took 192.50 ms. Allocated memory is still 96.5 MB. Free memory was 70.0 MB in the beginning and 63.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-02 22:49:12,955 INFO L168 Benchmark]: RCFGBuilder took 2221.52 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 63.1 MB in the beginning and 61.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. [2021-11-02 22:49:12,956 INFO L168 Benchmark]: TraceAbstraction took 99092.20 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 61.5 MB in the beginning and 71.5 MB in the end (delta: -10.0 MB). Peak memory consumption was 55.8 MB. Max. memory is 16.1 GB. [2021-11-02 22:49:12,956 INFO L168 Benchmark]: Witness Printer took 4.95 ms. Allocated memory is still 155.2 MB. Free memory is still 71.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:49:12,959 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 79.7 MB. Free memory is still 53.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 913.56 ms. Allocated memory is still 96.5 MB. Free memory was 73.5 MB in the beginning and 44.1 MB in the end (delta: 29.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 155.62 ms. Allocated memory is still 96.5 MB. Free memory was 44.1 MB in the beginning and 70.0 MB in the end (delta: -25.9 MB). Peak memory consumption was 10.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 192.50 ms. Allocated memory is still 96.5 MB. Free memory was 70.0 MB in the beginning and 63.1 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2221.52 ms. Allocated memory was 96.5 MB in the beginning and 127.9 MB in the end (delta: 31.5 MB). Free memory was 63.1 MB in the beginning and 61.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 99092.20 ms. Allocated memory was 127.9 MB in the beginning and 155.2 MB in the end (delta: 27.3 MB). Free memory was 61.5 MB in the beginning and 71.5 MB in the end (delta: -10.0 MB). Peak memory consumption was 55.8 MB. Max. memory is 16.1 GB. * Witness Printer took 4.95 ms. Allocated memory is still 155.2 MB. Free memory is still 71.5 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: 98.7s, OverallIterations: 48, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 91.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 9637 SDtfs, 2854 SDslu, 13795 SDs, 0 SdLazy, 7901 SolverSat, 413 SolverUnsat, 23 SolverUnknown, 0 SolverNotchecked, 85.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 95 SyntacticMatches, 32 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s 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.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 2.8s 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-02 22:49:13,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU --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-9ad7fb2 [2021-11-02 22:49:15,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:49:15,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:49:15,773 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:49:15,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:49:15,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:49:15,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:49:15,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:49:15,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:49:15,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:49:15,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:49:15,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:49:15,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:49:15,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:49:15,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:49:15,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:49:15,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:49:15,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:49:15,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:49:15,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:49:15,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:49:15,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:49:15,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:49:15,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:49:15,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:49:15,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:49:15,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:49:15,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:49:15,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:49:15,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:49:15,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:49:15,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:49:15,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:49:15,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:49:15,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:49:15,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:49:15,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:49:15,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:49:15,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:49:15,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:49:15,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:49:15,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-02 22:49:15,941 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:49:15,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:49:15,943 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:49:15,943 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:49:15,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:49:15,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:49:15,946 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:49:15,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:49:15,948 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:49:15,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:49:15,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:49:15,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:49:15,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:49:15,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:49:15,951 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 22:49:15,951 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 22:49:15,951 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:49:15,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:49:15,952 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:49:15,952 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:49:15,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:49:15,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:49:15,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:49:15,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:49:15,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:49:15,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:49:15,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:49:15,955 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 22:49:15,955 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 22:49:15,955 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:49:15,956 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:49:15,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:49:15,956 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:49:15,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 22:49:15,957 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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/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_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU 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-02 22:49:16,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:49:16,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:49:16,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:49:16,532 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:49:16,533 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:49:16,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-02 22:49:16,615 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/272cd6170/91f06465706147c68453730bbc8225a2/FLAG508ea9c31 [2021-11-02 22:49:17,490 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:49:17,491 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c [2021-11-02 22:49:17,522 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/272cd6170/91f06465706147c68453730bbc8225a2/FLAG508ea9c31 [2021-11-02 22:49:17,619 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/data/272cd6170/91f06465706147c68453730bbc8225a2 [2021-11-02 22:49:17,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:49:17,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:49:17,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:49:17,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:49:17,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:49:17,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:49:17" (1/1) ... [2021-11-02 22:49:17,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122c528a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:17, skipping insertion in model container [2021-11-02 22:49:17,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:49:17" (1/1) ... [2021-11-02 22:49:17,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:49:17,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:49:18,310 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_165726e1-0dc9-4d06-a403-135af47edaf5/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-02 22:49:18,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:49:18,351 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:49:18,601 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_165726e1-0dc9-4d06-a403-135af47edaf5/sv-benchmarks/c/openssl/s3_srvr.blast.11.i.cil-1.c[74369,74382] [2021-11-02 22:49:18,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:49:18,628 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:49:18,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18 WrapperNode [2021-11-02 22:49:18,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:49:18,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:49:18,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:49:18,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:49:18,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,798 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:49:18,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:49:18,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:49:18,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:49:18,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:49:18,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:49:18,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:49:18,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:49:18,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (1/1) ... [2021-11-02 22:49:18,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:49:18,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:49:19,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:49:19,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:49:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 22:49:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 22:49:19,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:49:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-02 22:49:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 22:49:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 22:49:19,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:49:19,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:49:19,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-02 22:49:19,364 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-02 22:49:24,131 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2021-11-02 22:49:24,131 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2021-11-02 22:49:24,142 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:49:24,142 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-11-02 22:49:24,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:49:24 BoogieIcfgContainer [2021-11-02 22:49:24,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:49:24,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:49:24,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:49:24,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:49:24,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:49:17" (1/3) ... [2021-11-02 22:49:24,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355fb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:49:24, skipping insertion in model container [2021-11-02 22:49:24,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:49:18" (2/3) ... [2021-11-02 22:49:24,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355fb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:49:24, skipping insertion in model container [2021-11-02 22:49:24,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:49:24" (3/3) ... [2021-11-02 22:49:24,156 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.11.i.cil-1.c [2021-11-02 22:49:24,166 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:49:24,167 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 22:49:24,230 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:49:24,250 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-02 22:49:24,256 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-02 22:49:24,281 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-02 22:49:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 22:49:24,292 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:24,293 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-02 22:49:24,294 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -442385417, now seen corresponding path program 1 times [2021-11-02 22:49:24,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:49:24,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840622947] [2021-11-02 22:49:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:24,322 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:49:24,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:49:24,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:49:24,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 22:49:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:24,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:49:24,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:49:25,035 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-02 22:49:25,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:49:25,388 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-02 22:49:25,389 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:49:25,390 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840622947] [2021-11-02 22:49:25,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840622947] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:25,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:25,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 22:49:25,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217535055] [2021-11-02 22:49:25,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:49:25,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:49:25,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:49:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:49:25,428 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-02 22:49:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:25,770 INFO L93 Difference]: Finished difference Result 563 states and 960 transitions. [2021-11-02 22:49:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:25,772 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-02 22:49:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:25,791 INFO L225 Difference]: With dead ends: 563 [2021-11-02 22:49:25,791 INFO L226 Difference]: Without dead ends: 384 [2021-11-02 22:49:25,795 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-02 22:49:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-11-02 22:49:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2021-11-02 22:49:25,870 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-02 22:49:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 582 transitions. [2021-11-02 22:49:25,876 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 582 transitions. Word has length 37 [2021-11-02 22:49:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:25,877 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 582 transitions. [2021-11-02 22:49:25,878 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-02 22:49:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 582 transitions. [2021-11-02 22:49:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 22:49:25,888 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:25,889 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-02 22:49:25,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-02 22:49:26,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:49:26,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1287801256, now seen corresponding path program 1 times [2021-11-02 22:49:26,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:49:26,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734860800] [2021-11-02 22:49:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:26,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:49:26,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:49:26,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:49:26,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 22:49:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:26,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:49:26,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:49:26,747 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-02 22:49:26,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:49:27,104 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-02 22:49:27,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:49:27,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734860800] [2021-11-02 22:49:27,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734860800] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:27,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:27,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 22:49:27,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132215934] [2021-11-02 22:49:27,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:49:27,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:49:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:49:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:49:27,109 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-02 22:49:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:27,422 INFO L93 Difference]: Finished difference Result 878 states and 1348 transitions. [2021-11-02 22:49:27,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:27,422 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-02 22:49:27,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:27,429 INFO L225 Difference]: With dead ends: 878 [2021-11-02 22:49:27,429 INFO L226 Difference]: Without dead ends: 630 [2021-11-02 22:49:27,432 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-02 22:49:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-11-02 22:49:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 628. [2021-11-02 22:49:27,480 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-02 22:49:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 953 transitions. [2021-11-02 22:49:27,484 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 953 transitions. Word has length 61 [2021-11-02 22:49:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:27,485 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 953 transitions. [2021-11-02 22:49:27,485 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-02 22:49:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 953 transitions. [2021-11-02 22:49:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-02 22:49:27,491 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:27,492 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-02 22:49:27,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:49:27,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:49:27,708 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:27,709 INFO L85 PathProgramCache]: Analyzing trace with hash 393853380, now seen corresponding path program 1 times [2021-11-02 22:49:27,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:49:27,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130594924] [2021-11-02 22:49:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:27,712 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:49:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:49:27,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:49:27,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 22:49:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:28,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-02 22:49:28,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:49:28,580 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-02 22:49:28,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:49:29,085 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-02 22:49:29,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:49:29,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130594924] [2021-11-02 22:49:29,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130594924] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:29,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:29,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-02 22:49:29,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452658150] [2021-11-02 22:49:29,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 22:49:29,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:49:29,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 22:49:29,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 22:49:29,089 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-02 22:49:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:29,380 INFO L93 Difference]: Finished difference Result 1368 states and 2088 transitions. [2021-11-02 22:49:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 22:49:29,381 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-02 22:49:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:29,388 INFO L225 Difference]: With dead ends: 1368 [2021-11-02 22:49:29,388 INFO L226 Difference]: Without dead ends: 874 [2021-11-02 22:49:29,390 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-02 22:49:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-02 22:49:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2021-11-02 22:49:29,432 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-02 22:49:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1323 transitions. [2021-11-02 22:49:29,437 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1323 transitions. Word has length 105 [2021-11-02 22:49:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:29,438 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 1323 transitions. [2021-11-02 22:49:29,438 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-02 22:49:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1323 transitions. [2021-11-02 22:49:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-02 22:49:29,444 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:29,445 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-02 22:49:29,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 22:49:29,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:49:29,660 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:29,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1006485834, now seen corresponding path program 1 times [2021-11-02 22:49:29,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:49:29,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014590016] [2021-11-02 22:49:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:29,663 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:49:29,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:49:29,680 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:49:29,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 22:49:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:30,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-02 22:49:30,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:49:30,304 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-02 22:49:30,321 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-02 22:49:30,526 INFO L354 Elim1Store]: treesize reduction 96, result has 16.5 percent of original size [2021-11-02 22:49:30,527 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-02 22:49:30,574 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-02 22:49:30,574 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-02 22:49:30,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:49:30,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:49:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:49:30,623 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-02 22:49:30,741 INFO L354 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2021-11-02 22:49:30,742 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-02 22:49:30,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 22:49:30,763 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-02 22:49:30,813 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-02 22:49:30,831 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-02 22:49:31,375 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-02 22:49:31,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:49:32,272 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-02 22:49:32,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:49:32,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014590016] [2021-11-02 22:49:32,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014590016] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:32,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:32,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-02 22:49:32,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795547733] [2021-11-02 22:49:32,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 22:49:32,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:49:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 22:49:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:49:32,277 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-02 22:49:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:49:44,269 INFO L93 Difference]: Finished difference Result 1745 states and 2642 transitions. [2021-11-02 22:49:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:49:44,272 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-02 22:49:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:49:44,279 INFO L225 Difference]: With dead ends: 1745 [2021-11-02 22:49:44,279 INFO L226 Difference]: Without dead ends: 874 [2021-11-02 22:49:44,281 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-02 22:49:44,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-11-02 22:49:44,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2021-11-02 22:49:44,322 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-02 22:49:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1322 transitions. [2021-11-02 22:49:44,327 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1322 transitions. Word has length 129 [2021-11-02 22:49:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:49:44,328 INFO L470 AbstractCegarLoop]: Abstraction has 874 states and 1322 transitions. [2021-11-02 22:49:44,328 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-02 22:49:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1322 transitions. [2021-11-02 22:49:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-02 22:49:44,332 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:49:44,333 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-02 22:49:44,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 22:49:44,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:49:44,554 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:49:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:49:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1440991432, now seen corresponding path program 1 times [2021-11-02 22:49:44,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:49:44,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637887266] [2021-11-02 22:49:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:49:44,557 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:49:44,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:49:44,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:49:44,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 22:49:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:49:45,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:49:45,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:49:45,512 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-02 22:49:45,582 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-02 22:49:45,582 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-02 22:49:46,000 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-02 22:49:46,001 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-02 22:49:46,304 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-02 22:49:46,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:49:46,963 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-02 22:49:46,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:49:46,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637887266] [2021-11-02 22:49:46,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637887266] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:49:46,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:49:46,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2021-11-02 22:49:46,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533946186] [2021-11-02 22:49:46,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:49:46,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:49:46,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:49:46,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:49:46,966 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-02 22:50:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:50:00,619 INFO L93 Difference]: Finished difference Result 3290 states and 5000 transitions. [2021-11-02 22:50:00,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 22:50:00,620 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-02 22:50:00,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:50:00,636 INFO L225 Difference]: With dead ends: 3290 [2021-11-02 22:50:00,636 INFO L226 Difference]: Without dead ends: 2426 [2021-11-02 22:50:00,638 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-02 22:50:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2021-11-02 22:50:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1048. [2021-11-02 22:50:00,698 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-02 22:50:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1622 transitions. [2021-11-02 22:50:00,703 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1622 transitions. Word has length 129 [2021-11-02 22:50:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:50:00,704 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1622 transitions. [2021-11-02 22:50:00,704 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-02 22:50:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1622 transitions. [2021-11-02 22:50:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-02 22:50:00,707 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:50:00,708 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-02 22:50:00,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-02 22:50:00,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:50:00,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:50:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:50:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 895401078, now seen corresponding path program 1 times [2021-11-02 22:50:00,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:50:00,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590838506] [2021-11-02 22:50:00,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:50:00,928 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:50:00,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:50:00,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:50:00,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 22:50:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:50:03,005 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:50:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:50:05,436 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-02 22:50:05,436 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:50:05,437 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 22:50:05,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-02 22:50:05,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:50:05,664 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2021-11-02 22:50:05,668 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:50:05,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:50:05 BoogieIcfgContainer [2021-11-02 22:50:05,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:50:05,846 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:50:05,846 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:50:05,847 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:50:05,847 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:49:24" (3/4) ... [2021-11-02 22:50:05,850 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-02 22:50:06,085 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/witness.graphml [2021-11-02 22:50:06,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:50:06,086 INFO L168 Benchmark]: Toolchain (without parser) took 48462.33 ms. Allocated memory was 67.1 MB in the beginning and 115.3 MB in the end (delta: 48.2 MB). Free memory was 44.3 MB in the beginning and 67.8 MB in the end (delta: -23.6 MB). Peak memory consumption was 66.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,087 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 67.1 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:50:06,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1001.50 ms. Allocated memory is still 67.1 MB. Free memory was 44.0 MB in the beginning and 27.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 168.25 ms. Allocated memory is still 67.1 MB. Free memory was 27.0 MB in the beginning and 45.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,089 INFO L168 Benchmark]: Boogie Preprocessor took 162.77 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 37.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,089 INFO L168 Benchmark]: RCFGBuilder took 5183.21 ms. Allocated memory was 67.1 MB in the beginning and 90.2 MB in the end (delta: 23.1 MB). Free memory was 37.8 MB in the beginning and 60.7 MB in the end (delta: -22.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,090 INFO L168 Benchmark]: TraceAbstraction took 41697.86 ms. Allocated memory was 90.2 MB in the beginning and 115.3 MB in the end (delta: 25.2 MB). Free memory was 60.2 MB in the beginning and 30.7 MB in the end (delta: 29.4 MB). Peak memory consumption was 53.0 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,090 INFO L168 Benchmark]: Witness Printer took 239.38 ms. Allocated memory is still 115.3 MB. Free memory was 30.7 MB in the beginning and 67.8 MB in the end (delta: -37.1 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2021-11-02 22:50:06,097 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.30 ms. Allocated memory is still 67.1 MB. Free memory is still 46.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1001.50 ms. Allocated memory is still 67.1 MB. Free memory was 44.0 MB in the beginning and 27.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 168.25 ms. Allocated memory is still 67.1 MB. Free memory was 27.0 MB in the beginning and 45.0 MB in the end (delta: -18.0 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 162.77 ms. Allocated memory is still 67.1 MB. Free memory was 45.0 MB in the beginning and 37.8 MB in the end (delta: 7.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5183.21 ms. Allocated memory was 67.1 MB in the beginning and 90.2 MB in the end (delta: 23.1 MB). Free memory was 37.8 MB in the beginning and 60.7 MB in the end (delta: -22.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 41697.86 ms. Allocated memory was 90.2 MB in the beginning and 115.3 MB in the end (delta: 25.2 MB). Free memory was 60.2 MB in the beginning and 30.7 MB in the end (delta: 29.4 MB). Peak memory consumption was 53.0 MB. Max. memory is 16.1 GB. * Witness Printer took 239.38 ms. Allocated memory is still 115.3 MB. Free memory was 30.7 MB in the beginning and 67.8 MB in the end (delta: -37.1 MB). Peak memory consumption was 4.9 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: 41.4s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.6s, 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, 24.5s 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1382 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 6.2s 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-02 22:50:06,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_165726e1-0dc9-4d06-a403-135af47edaf5/bin/uautomizer-tBqnrhUYjU/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