./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:26:09,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:26:09,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:26:09,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:26:09,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:26:09,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:26:09,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:26:09,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:26:09,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:26:09,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:26:09,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:26:09,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:26:09,443 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:26:09,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:26:09,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:26:09,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:26:09,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:26:09,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:26:09,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:26:09,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:26:09,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:26:09,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:26:09,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:26:09,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:26:09,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:26:09,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:26:09,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:26:09,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:26:09,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:26:09,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:26:09,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:26:09,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:26:09,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:26:09,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:26:09,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:26:09,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:26:09,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:26:09,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:26:09,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:26:09,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:26:09,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:26:09,502 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:26:09,548 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:26:09,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:26:09,549 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:26:09,549 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:26:09,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:26:09,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:26:09,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:26:09,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:26:09,553 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:26:09,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:26:09,555 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:26:09,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:26:09,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:26:09,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:26:09,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:26:09,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:26:09,557 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:26:09,557 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:26:09,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:26:09,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:26:09,558 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:26:09,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:26:09,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:26:09,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:26:09,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:26:09,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:26:09,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:26:09,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:26:09,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:26:09,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:26:09,564 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:26:09,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:26:09,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:26:09,565 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_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2022-11-02 20:26:09,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:26:09,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:26:09,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:26:09,965 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:26:09,966 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:26:09,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-11-02 20:26:10,051 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/data/b7b5287bb/6ddcba32eeca4abb84735bca7475c262/FLAG42269481f [2022-11-02 20:26:10,689 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:26:10,692 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-11-02 20:26:10,708 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/data/b7b5287bb/6ddcba32eeca4abb84735bca7475c262/FLAG42269481f [2022-11-02 20:26:11,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/data/b7b5287bb/6ddcba32eeca4abb84735bca7475c262 [2022-11-02 20:26:11,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:26:11,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:26:11,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:26:11,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:26:11,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:26:11,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84c9d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11, skipping insertion in model container [2022-11-02 20:26:11,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:26:11,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:26:11,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-11-02 20:26:11,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-11-02 20:26:11,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-11-02 20:26:11,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-11-02 20:26:11,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-11-02 20:26:11,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-11-02 20:26:11,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-11-02 20:26:11,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-11-02 20:26:11,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-11-02 20:26:11,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-11-02 20:26:11,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-11-02 20:26:11,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-11-02 20:26:11,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-11-02 20:26:11,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-11-02 20:26:11,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-11-02 20:26:11,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-11-02 20:26:11,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-11-02 20:26:11,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-11-02 20:26:11,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:26:11,526 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:26:11,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-11-02 20:26:11,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-11-02 20:26:11,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-11-02 20:26:11,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-11-02 20:26:11,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-11-02 20:26:11,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-11-02 20:26:11,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-11-02 20:26:11,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-11-02 20:26:11,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-11-02 20:26:11,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-11-02 20:26:11,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-11-02 20:26:11,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-11-02 20:26:11,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-11-02 20:26:11,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-11-02 20:26:11,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-11-02 20:26:11,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-11-02 20:26:11,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-11-02 20:26:11,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-11-02 20:26:11,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:26:11,635 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:26:11,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11 WrapperNode [2022-11-02 20:26:11,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:26:11,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:26:11,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:26:11,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:26:11,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,719 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 254 [2022-11-02 20:26:11,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:26:11,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:26:11,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:26:11,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:26:11,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:26:11,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:26:11,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:26:11,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:26:11,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (1/1) ... [2022-11-02 20:26:11,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:26:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:11,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:26:11,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:26:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:26:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:26:11,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:26:11,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:26:12,042 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:26:12,044 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:26:12,428 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:26:12,435 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:26:12,436 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:26:12,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:26:12 BoogieIcfgContainer [2022-11-02 20:26:12,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:26:12,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:26:12,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:26:12,462 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:26:12,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:26:11" (1/3) ... [2022-11-02 20:26:12,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7752de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:26:12, skipping insertion in model container [2022-11-02 20:26:12,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:26:11" (2/3) ... [2022-11-02 20:26:12,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7752de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:26:12, skipping insertion in model container [2022-11-02 20:26:12,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:26:12" (3/3) ... [2022-11-02 20:26:12,466 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-11-02 20:26:12,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:26:12,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-02 20:26:12,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:26:12,644 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6dbccbb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:26:12,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-02 20:26:12,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:26:12,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:12,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:12,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2022-11-02 20:26:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:12,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981668505] [2022-11-02 20:26:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:13,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981668505] [2022-11-02 20:26:13,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981668505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:13,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:13,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:26:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522080036] [2022-11-02 20:26:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:13,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:26:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:26:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:13,117 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:13,167 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-11-02 20:26:13,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:26:13,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-02 20:26:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:13,187 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:26:13,188 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:26:13,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:13,199 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:13,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:26:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-02 20:26:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 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) [2022-11-02 20:26:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-11-02 20:26:13,269 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2022-11-02 20:26:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:13,269 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-11-02 20:26:13,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-11-02 20:26:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:26:13,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:13,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:13,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:26:13,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:13,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2022-11-02 20:26:13,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:13,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366612260] [2022-11-02 20:26:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:13,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:13,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366612260] [2022-11-02 20:26:13,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366612260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:13,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:13,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:26:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524874230] [2022-11-02 20:26:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:13,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:13,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:13,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:13,500 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:13,657 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-11-02 20:26:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:13,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-02 20:26:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:13,660 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:26:13,660 INFO L226 Difference]: Without dead ends: 74 [2022-11-02 20:26:13,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:13,662 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 246 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:13,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 80 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-02 20:26:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-02 20:26:13,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-02 20:26:13,680 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2022-11-02 20:26:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:13,681 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-02 20:26:13,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-02 20:26:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:26:13,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:13,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:13,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:26:13,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2022-11-02 20:26:13,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:13,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792391607] [2022-11-02 20:26:13,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:13,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:13,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:13,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792391607] [2022-11-02 20:26:13,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792391607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:13,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:13,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:13,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832812404] [2022-11-02 20:26:13,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:13,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:13,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:13,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:13,899 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:14,046 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-02 20:26:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:14,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-02 20:26:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:14,050 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:26:14,051 INFO L226 Difference]: Without dead ends: 95 [2022-11-02 20:26:14,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:14,052 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 110 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:14,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-02 20:26:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2022-11-02 20:26:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-11-02 20:26:14,074 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2022-11-02 20:26:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:14,074 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-11-02 20:26:14,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-11-02 20:26:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:26:14,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:14,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:26:14,076 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2022-11-02 20:26:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:14,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638078605] [2022-11-02 20:26:14,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:14,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:14,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638078605] [2022-11-02 20:26:14,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638078605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:14,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:14,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199112984] [2022-11-02 20:26:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:14,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:14,278 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:14,358 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-02 20:26:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-02 20:26:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:14,360 INFO L225 Difference]: With dead ends: 72 [2022-11-02 20:26:14,360 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:26:14,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:14,362 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 165 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:14,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:26:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-02 20:26:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 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) [2022-11-02 20:26:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-11-02 20:26:14,372 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2022-11-02 20:26:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:14,373 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-11-02 20:26:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-11-02 20:26:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:26:14,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:14,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:14,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:26:14,375 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2022-11-02 20:26:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:14,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181524087] [2022-11-02 20:26:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181524087] [2022-11-02 20:26:14,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181524087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:14,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:14,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147941581] [2022-11-02 20:26:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:14,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:14,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:14,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:14,583 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:14,838 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-11-02 20:26:14,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:26:14,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-02 20:26:14,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:14,846 INFO L225 Difference]: With dead ends: 137 [2022-11-02 20:26:14,847 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:26:14,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:14,853 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 128 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:14,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:26:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2022-11-02 20:26:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-02 20:26:14,882 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2022-11-02 20:26:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:14,883 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-02 20:26:14,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-02 20:26:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:26:14,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:14,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:14,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:26:14,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:14,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:14,888 INFO L85 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2022-11-02 20:26:14,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:14,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105626603] [2022-11-02 20:26:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:15,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:15,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105626603] [2022-11-02 20:26:15,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105626603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:15,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:15,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:15,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304260248] [2022-11-02 20:26:15,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:15,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:15,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:15,017 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:15,190 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-11-02 20:26:15,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:26:15,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-02 20:26:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:15,192 INFO L225 Difference]: With dead ends: 104 [2022-11-02 20:26:15,193 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:26:15,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:15,198 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:15,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 171 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:26:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2022-11-02 20:26:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 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) [2022-11-02 20:26:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-11-02 20:26:15,230 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2022-11-02 20:26:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:15,231 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-11-02 20:26:15,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-11-02 20:26:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:26:15,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:15,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:15,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:26:15,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2022-11-02 20:26:15,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:15,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169347970] [2022-11-02 20:26:15,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:15,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169347970] [2022-11-02 20:26:15,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169347970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:15,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:15,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:15,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9351759] [2022-11-02 20:26:15,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:15,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:15,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:15,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:15,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:15,374 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:15,525 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2022-11-02 20:26:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-02 20:26:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:15,527 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:26:15,527 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:26:15,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:15,528 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 148 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:15,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:26:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-11-02 20:26:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-02 20:26:15,540 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2022-11-02 20:26:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:15,540 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-02 20:26:15,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-02 20:26:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:26:15,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:15,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:15,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:26:15,542 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2022-11-02 20:26:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:15,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017023740] [2022-11-02 20:26:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:15,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:15,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017023740] [2022-11-02 20:26:15,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017023740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:15,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:15,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:15,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386491124] [2022-11-02 20:26:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:15,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:15,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:15,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:15,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:15,648 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:15,732 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-02 20:26:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:15,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-02 20:26:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:15,734 INFO L225 Difference]: With dead ends: 73 [2022-11-02 20:26:15,734 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:26:15,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:15,735 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:15,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:15,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:26:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:26:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-11-02 20:26:15,744 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2022-11-02 20:26:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:15,744 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-11-02 20:26:15,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-11-02 20:26:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:26:15,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:15,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:15,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:26:15,747 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:15,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2022-11-02 20:26:15,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:15,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715030967] [2022-11-02 20:26:15,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:15,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:15,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:15,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715030967] [2022-11-02 20:26:15,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715030967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:15,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:15,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:26:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759981745] [2022-11-02 20:26:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:15,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:26:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:26:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:15,781 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:15,828 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-11-02 20:26:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:26:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-02 20:26:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:15,830 INFO L225 Difference]: With dead ends: 111 [2022-11-02 20:26:15,830 INFO L226 Difference]: Without dead ends: 71 [2022-11-02 20:26:15,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:26:15,832 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:15,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-02 20:26:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-02 20:26:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-02 20:26:15,840 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2022-11-02 20:26:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:15,841 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-02 20:26:15,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-02 20:26:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:26:15,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:15,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:15,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:26:15,843 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2022-11-02 20:26:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:15,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118122708] [2022-11-02 20:26:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:26:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118122708] [2022-11-02 20:26:15,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118122708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:15,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081864508] [2022-11-02 20:26:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:15,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:15,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:15,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:15,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:26:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:16,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:26:16,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:26:16,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:26:16,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081864508] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:16,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:16,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:26:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886173242] [2022-11-02 20:26:16,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:16,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:16,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:16,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:16,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:16,293 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:16,421 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-11-02 20:26:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:16,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 26 [2022-11-02 20:26:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:16,423 INFO L225 Difference]: With dead ends: 111 [2022-11-02 20:26:16,424 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:26:16,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:16,438 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:16,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 179 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:16,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:26:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2022-11-02 20:26:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 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) [2022-11-02 20:26:16,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-11-02 20:26:16,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2022-11-02 20:26:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:16,447 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-11-02 20:26:16,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-11-02 20:26:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:26:16,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:16,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:16,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:26:16,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:26:16,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2022-11-02 20:26:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:16,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16499636] [2022-11-02 20:26:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:16,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:16,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16499636] [2022-11-02 20:26:16,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16499636] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:16,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:16,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:16,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900514104] [2022-11-02 20:26:16,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:16,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:16,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:16,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:16,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:16,790 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:16,856 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-11-02 20:26:16,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:16,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-02 20:26:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:16,857 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:26:16,858 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:26:16,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:16,859 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:16,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 72 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:26:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-02 20:26:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 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) [2022-11-02 20:26:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-11-02 20:26:16,866 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-11-02 20:26:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:16,866 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-11-02 20:26:16,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-11-02 20:26:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:26:16,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:16,868 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 20:26:16,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:26:16,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:16,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2022-11-02 20:26:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:16,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288909319] [2022-11-02 20:26:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:26:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:16,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288909319] [2022-11-02 20:26:16,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288909319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:16,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540253486] [2022-11-02 20:26:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:16,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:16,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:17,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:26:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:17,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:26:17,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:26:17,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:26:17,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540253486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:17,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:17,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:26:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077529067] [2022-11-02 20:26:17,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:17,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:17,222 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:17,301 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-02 20:26:17,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:17,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 27 [2022-11-02 20:26:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:17,303 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:26:17,304 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:26:17,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:17,305 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 152 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:17,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 67 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:17,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:26:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-11-02 20:26:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-11-02 20:26:17,312 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2022-11-02 20:26:17,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:17,312 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-11-02 20:26:17,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,313 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-11-02 20:26:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:26:17,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:17,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:17,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:26:17,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:26:17,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2022-11-02 20:26:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:17,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280689607] [2022-11-02 20:26:17,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:17,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280689607] [2022-11-02 20:26:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280689607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:17,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:17,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945612026] [2022-11-02 20:26:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:17,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:17,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:17,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:17,690 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:17,770 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-11-02 20:26:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:17,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-02 20:26:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:17,772 INFO L225 Difference]: With dead ends: 60 [2022-11-02 20:26:17,772 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:26:17,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:17,774 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 108 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:17,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:26:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-02 20:26:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-02 20:26:17,782 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2022-11-02 20:26:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:17,783 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-02 20:26:17,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-02 20:26:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:26:17,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:17,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:17,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:26:17,789 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:17,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2022-11-02 20:26:17,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:17,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380285012] [2022-11-02 20:26:17,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:17,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:17,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:17,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380285012] [2022-11-02 20:26:17,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380285012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:17,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:17,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552482573] [2022-11-02 20:26:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:17,930 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:17,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:17,997 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-11-02 20:26:17,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:17,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-02 20:26:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:17,999 INFO L225 Difference]: With dead ends: 59 [2022-11-02 20:26:17,999 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 20:26:17,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:18,001 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:18,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 20:26:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-11-02 20:26:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-11-02 20:26:18,008 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2022-11-02 20:26:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:18,008 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-11-02 20:26:18,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-11-02 20:26:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:26:18,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:18,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:18,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:26:18,012 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2022-11-02 20:26:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:18,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121848304] [2022-11-02 20:26:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:18,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:18,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121848304] [2022-11-02 20:26:18,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121848304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:18,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:18,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:26:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652329203] [2022-11-02 20:26:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:18,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:18,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:18,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:18,147 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:18,254 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-02 20:26:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:18,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-02 20:26:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:18,255 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:26:18,255 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:26:18,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:26:18,259 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 125 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:18,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:26:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-02 20:26:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-02 20:26:18,267 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2022-11-02 20:26:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:18,267 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-02 20:26:18,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-02 20:26:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:26:18,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:18,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:18,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:26:18,272 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2022-11-02 20:26:18,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:18,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734210489] [2022-11-02 20:26:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:18,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734210489] [2022-11-02 20:26:18,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734210489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:18,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:18,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054915021] [2022-11-02 20:26:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:18,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:18,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:18,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:18,390 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:18,521 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-02 20:26:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:26:18,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-11-02 20:26:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:18,523 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:26:18,523 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:26:18,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:18,524 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 93 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:18,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:26:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2022-11-02 20:26:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-11-02 20:26:18,535 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2022-11-02 20:26:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:18,535 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-11-02 20:26:18,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-11-02 20:26:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:26:18,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:18,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:18,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:26:18,538 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2022-11-02 20:26:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:18,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521739252] [2022-11-02 20:26:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:18,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:18,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:18,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521739252] [2022-11-02 20:26:18,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521739252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:18,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:18,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172994503] [2022-11-02 20:26:18,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:18,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:18,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:18,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:18,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:18,667 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:18,761 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-11-02 20:26:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:18,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-02 20:26:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:18,762 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:26:18,763 INFO L226 Difference]: Without dead ends: 55 [2022-11-02 20:26:18,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:18,764 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:18,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-02 20:26:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-02 20:26:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-02 20:26:18,773 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2022-11-02 20:26:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:18,773 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-02 20:26:18,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-02 20:26:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:26:18,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:18,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:18,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:26:18,775 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:18,776 INFO L85 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2022-11-02 20:26:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:18,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474448888] [2022-11-02 20:26:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:18,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:18,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474448888] [2022-11-02 20:26:18,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474448888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:18,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:18,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:26:18,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974408474] [2022-11-02 20:26:18,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:18,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:26:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:26:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:26:18,861 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:18,898 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-02 20:26:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:18,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:26:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:18,900 INFO L225 Difference]: With dead ends: 66 [2022-11-02 20:26:18,900 INFO L226 Difference]: Without dead ends: 64 [2022-11-02 20:26:18,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:18,901 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:18,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-02 20:26:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-11-02 20:26:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-02 20:26:18,910 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2022-11-02 20:26:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:18,911 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-02 20:26:18,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-11-02 20:26:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:26:18,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:18,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:26:18,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2022-11-02 20:26:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:18,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702443886] [2022-11-02 20:26:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702443886] [2022-11-02 20:26:19,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702443886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:19,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:19,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:19,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646694295] [2022-11-02 20:26:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:19,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:19,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:19,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:19,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:19,015 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:19,053 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-11-02 20:26:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 20:26:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:19,055 INFO L225 Difference]: With dead ends: 62 [2022-11-02 20:26:19,055 INFO L226 Difference]: Without dead ends: 60 [2022-11-02 20:26:19,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:19,056 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:19,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 172 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-02 20:26:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-11-02 20:26:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 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) [2022-11-02 20:26:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-11-02 20:26:19,066 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2022-11-02 20:26:19,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:19,066 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-11-02 20:26:19,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-11-02 20:26:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:26:19,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:19,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:19,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:26:19,068 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:19,069 INFO L85 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2022-11-02 20:26:19,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:19,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427869673] [2022-11-02 20:26:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:19,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:19,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427869673] [2022-11-02 20:26:19,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427869673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:19,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:19,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:19,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138745755] [2022-11-02 20:26:19,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:19,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:19,169 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:19,323 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-02 20:26:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:26:19,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-02 20:26:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:19,325 INFO L225 Difference]: With dead ends: 84 [2022-11-02 20:26:19,325 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:26:19,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:19,326 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:19,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 125 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:19,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:26:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2022-11-02 20:26:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-02 20:26:19,336 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2022-11-02 20:26:19,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:19,336 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-02 20:26:19,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-02 20:26:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:26:19,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:19,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:19,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:26:19,338 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:19,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:19,339 INFO L85 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2022-11-02 20:26:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:19,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580990337] [2022-11-02 20:26:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:19,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580990337] [2022-11-02 20:26:19,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580990337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:19,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:19,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496317615] [2022-11-02 20:26:19,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:19,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:19,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:19,440 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:19,546 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-11-02 20:26:19,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:26:19,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-11-02 20:26:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:19,551 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:26:19,552 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:26:19,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:26:19,553 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:19,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:19,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:26:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-11-02 20:26:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-02 20:26:19,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2022-11-02 20:26:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:19,563 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-02 20:26:19,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-02 20:26:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:26:19,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:19,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:19,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:26:19,565 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2022-11-02 20:26:19,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:19,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753313760] [2022-11-02 20:26:19,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:19,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753313760] [2022-11-02 20:26:19,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753313760] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:26:19,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973189635] [2022-11-02 20:26:19,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:19,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:26:19,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:26:19,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:26:19,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:26:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:26:19,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:26:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:26:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:26:19,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973189635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:19,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:19,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-02 20:26:19,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948279136] [2022-11-02 20:26:19,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:19,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:26:19,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:19,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:26:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:26:19,959 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:20,034 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-11-02 20:26:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:26:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 40 [2022-11-02 20:26:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:20,035 INFO L225 Difference]: With dead ends: 54 [2022-11-02 20:26:20,036 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 20:26:20,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:20,039 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 55 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:20,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 54 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:26:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 20:26:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-02 20:26:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-02 20:26:20,048 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2022-11-02 20:26:20,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:20,049 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-02 20:26:20,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-02 20:26:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:26:20,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:26:20,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:20,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:26:20,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:26:20,266 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-02 20:26:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:26:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2022-11-02 20:26:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:26:20,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15940196] [2022-11-02 20:26:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:26:20,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:26:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:26:20,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:26:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:26:20,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15940196] [2022-11-02 20:26:20,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15940196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:26:20,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:26:20,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:26:20,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607602290] [2022-11-02 20:26:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:26:20,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:26:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:20,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:26:20,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:26:20,362 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:26:20,488 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-02 20:26:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:26:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-02 20:26:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:26:20,489 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:26:20,489 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:26:20,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:26:20,494 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:26:20,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:26:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:26:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:26:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:26:20,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-02 20:26:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:26:20,498 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:26:20,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:26:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:26:20,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:26:20,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-11-02 20:26:20,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-11-02 20:26:20,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-11-02 20:26:20,502 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-11-02 20:26:20,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-11-02 20:26:20,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-11-02 20:26:20,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-11-02 20:26:20,503 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-11-02 20:26:20,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-11-02 20:26:20,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-11-02 20:26:20,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-11-02 20:26:20,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-11-02 20:26:20,504 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-11-02 20:26:20,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-11-02 20:26:20,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-11-02 20:26:20,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-11-02 20:26:20,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-11-02 20:26:20,505 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-11-02 20:26:20,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:26:20,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:26:40,525 WARN L234 SmtUtils]: Spent 20.01s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:26:46,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-11-02 20:26:46,114 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-02 20:26:46,114 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-11-02 20:26:46,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-11-02 20:26:46,114 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-11-02 20:26:46,114 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:26:46,115 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-11-02 20:26:46,115 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-11-02 20:26:46,115 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-11-02 20:26:46,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-11-02 20:26:46,116 INFO L895 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse2 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse4 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse2 .cse3 .cse4)))) [2022-11-02 20:26:46,116 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-11-02 20:26:46,116 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-11-02 20:26:46,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-11-02 20:26:46,117 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-11-02 20:26:46,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-11-02 20:26:46,119 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-11-02 20:26:46,120 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-11-02 20:26:46,120 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-11-02 20:26:46,120 INFO L899 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-11-02 20:26:46,120 INFO L899 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-11-02 20:26:46,120 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-11-02 20:26:46,120 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-02 20:26:46,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-11-02 20:26:46,121 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-11-02 20:26:46,121 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:26:46,121 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-11-02 20:26:46,121 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-02 20:26:46,121 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-11-02 20:26:46,122 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-11-02 20:26:46,122 INFO L895 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse5 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) .cse5) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse3 .cse4 .cse5)))) [2022-11-02 20:26:46,122 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-11-02 20:26:46,122 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-11-02 20:26:46,122 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-11-02 20:26:46,123 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-11-02 20:26:46,123 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-02 20:26:46,123 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-11-02 20:26:46,123 INFO L895 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1) (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (let ((.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse5 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse7 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse9 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse12 .cse13) (and .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))))) (or (and .cse0 (= |ULTIMATE.start_main_~main__c~0#1| 0)) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0)))) [2022-11-02 20:26:46,124 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-11-02 20:26:46,124 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-11-02 20:26:46,124 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-11-02 20:26:46,124 INFO L895 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) [2022-11-02 20:26:46,125 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-11-02 20:26:46,125 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-11-02 20:26:46,125 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-11-02 20:26:46,125 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-11-02 20:26:46,125 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-02 20:26:46,125 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-11-02 20:26:46,126 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-11-02 20:26:46,126 INFO L899 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-11-02 20:26:46,126 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-11-02 20:26:46,126 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:26:46,126 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-11-02 20:26:46,126 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-02 20:26:46,127 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-11-02 20:26:46,127 INFO L895 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse4 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse6 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse8 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse11 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse13 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse16 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))) (.cse1 (= |ULTIMATE.start_main_~main__c~0#1| 0))) (or (and (let ((.cse0 (let ((.cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)))) (or (and .cse2 .cse3 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse15 .cse16))))) (or (and .cse0 .cse1) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0))) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1) .cse11 .cse12 .cse13 .cse14 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) .cse15 .cse16 .cse1))) [2022-11-02 20:26:46,127 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-11-02 20:26:46,128 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-11-02 20:26:46,128 INFO L902 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2022-11-02 20:26:46,128 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-11-02 20:26:46,131 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:26:46,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:26:46,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:26:46 BoogieIcfgContainer [2022-11-02 20:26:46,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:26:46,171 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:26:46,171 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:26:46,171 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:26:46,172 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:26:12" (3/4) ... [2022-11-02 20:26:46,175 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:26:46,198 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 20:26:46,199 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:26:46,200 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:26:46,200 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:26:46,270 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:26:46,270 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:26:46,271 INFO L158 Benchmark]: Toolchain (without parser) took 35256.82ms. Allocated memory was 102.8MB in the beginning and 488.6MB in the end (delta: 385.9MB). Free memory was 65.6MB in the beginning and 260.1MB in the end (delta: -194.5MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,271 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 102.8MB. Free memory was 82.7MB in the beginning and 82.6MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:26:46,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.61ms. Allocated memory is still 102.8MB. Free memory was 65.4MB in the beginning and 69.8MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.71ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 67.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,272 INFO L158 Benchmark]: Boogie Preprocessor took 61.01ms. Allocated memory is still 102.8MB. Free memory was 67.6MB in the beginning and 66.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,273 INFO L158 Benchmark]: RCFGBuilder took 649.65ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 48.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,273 INFO L158 Benchmark]: TraceAbstraction took 33729.46ms. Allocated memory was 102.8MB in the beginning and 488.6MB in the end (delta: 385.9MB). Free memory was 48.1MB in the beginning and 265.4MB in the end (delta: -217.2MB). Peak memory consumption was 262.2MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,274 INFO L158 Benchmark]: Witness Printer took 99.71ms. Allocated memory is still 488.6MB. Free memory was 265.4MB in the beginning and 260.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:26:46,275 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.35ms. Allocated memory is still 102.8MB. Free memory was 82.7MB in the beginning and 82.6MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.61ms. Allocated memory is still 102.8MB. Free memory was 65.4MB in the beginning and 69.8MB in the end (delta: -4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.71ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 67.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.01ms. Allocated memory is still 102.8MB. Free memory was 67.6MB in the beginning and 66.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 649.65ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 48.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 33729.46ms. Allocated memory was 102.8MB in the beginning and 488.6MB in the end (delta: 385.9MB). Free memory was 48.1MB in the beginning and 265.4MB in the end (delta: -217.2MB). Peak memory consumption was 262.2MB. Max. memory is 16.1GB. * Witness Printer took 99.71ms. Allocated memory is still 488.6MB. Free memory was 265.4MB in the beginning and 260.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 33.5s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2162 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 2684 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1437 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1152 IncrementalHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 1247 mSDtfsCounter, 1152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 209 SyntacticMatches, 22 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 679 HoareAnnotationTreeSize, 6 FomulaSimplifications, 68218 FormulaSimplificationTreeSizeReduction, 24.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 312870 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 1795 SizeOfPredicates, 12 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) && 1 <= __VERIFIER_assert__cond) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: main__cp < main__urilen && ((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(main__scheme <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (!(main__urilen <= main__cp) && __VERIFIER_assert__cond == 1) && ((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) RESULT: Ultimate proved your program to be correct! [2022-11-02 20:26:46,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d417d6b2-7ec7-4a4b-a63e-9d9d941b85b5/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE