./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-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_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/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_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/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_64798403-1353-426a-ac07-d15e9a7af082/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 fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --- 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:33:43,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:33:43,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:33:43,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:33:43,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:33:43,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:33:43,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:33:43,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:33:43,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:33:43,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:33:43,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:33:43,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:33:43,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:33:43,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:33:43,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:33:43,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:33:43,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:33:43,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:33:43,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:33:43,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:33:43,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:33:43,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:33:43,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:33:43,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:33:43,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:33:43,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:33:43,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:33:43,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:33:43,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:33:43,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:33:43,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:33:43,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:33:43,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:33:43,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:33:43,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:33:43,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:33:43,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:33:43,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:33:43,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:33:43,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:33:43,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:33:43,582 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:33:43,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:33:43,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:33:43,633 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:33:43,633 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:33:43,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:33:43,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:33:43,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:33:43,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:33:43,637 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:33:43,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:33:43,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:33:43,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:33:43,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:33:43,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:33:43,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:33:43,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:33:43,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:33:43,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:33:43,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:33:43,642 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:33:43,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:33:43,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:33:43,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:33:43,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:33:43,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:33:43,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:33:43,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:33:43,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:33:43,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:33:43,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:33:43,645 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:33:43,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:33:43,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:33:43,646 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_64798403-1353-426a-ac07-d15e9a7af082/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_64798403-1353-426a-ac07-d15e9a7af082/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 -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e [2022-11-02 20:33:44,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:33:44,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:33:44,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:33:44,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:33:44,121 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:33:44,123 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-11-02 20:33:44,209 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/data/82387ac8e/e4d7fbdc28d04fe99f6aa9c4aa74773b/FLAGd0352a68c [2022-11-02 20:33:44,855 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:33:44,856 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2022-11-02 20:33:44,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/data/82387ac8e/e4d7fbdc28d04fe99f6aa9c4aa74773b/FLAGd0352a68c [2022-11-02 20:33:45,208 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/data/82387ac8e/e4d7fbdc28d04fe99f6aa9c4aa74773b [2022-11-02 20:33:45,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:33:45,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:33:45,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:45,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:33:45,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:33:45,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f80083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45, skipping insertion in model container [2022-11-02 20:33:45,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:33:45,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-11-02 20:33:45,564 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-11-02 20:33:45,566 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-11-02 20:33:45,571 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-11-02 20:33:45,574 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-11-02 20:33:45,579 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-11-02 20:33:45,581 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-11-02 20:33:45,584 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-11-02 20:33:45,586 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-11-02 20:33:45,589 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-11-02 20:33:45,594 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-11-02 20:33:45,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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-11-02 20:33:45,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:45,611 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:33:45,630 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2022-11-02 20:33:45,632 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2022-11-02 20:33:45,634 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2022-11-02 20:33:45,636 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2022-11-02 20:33:45,639 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2022-11-02 20:33:45,640 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2022-11-02 20:33:45,643 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2022-11-02 20:33:45,644 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2022-11-02 20:33:45,646 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2022-11-02 20:33:45,648 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2022-11-02 20:33:45,652 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2022-11-02 20:33:45,653 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2022-11-02 20:33:45,656 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2022-11-02 20:33:45,659 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2022-11-02 20:33:45,660 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2022-11-02 20:33:45,663 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2022-11-02 20:33:45,664 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_64798403-1353-426a-ac07-d15e9a7af082/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2022-11-02 20:33:45,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:33:45,683 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:33:45,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45 WrapperNode [2022-11-02 20:33:45,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:33:45,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:45,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:33:45,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:33:45,696 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:33:45" (1/1) ... [2022-11-02 20:33:45,706 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:33:45" (1/1) ... [2022-11-02 20:33:45,737 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 229 [2022-11-02 20:33:45,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:33:45,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:33:45,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:33:45,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:33:45,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,764 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:33:45,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:33:45,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:33:45,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:33:45,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (1/1) ... [2022-11-02 20:33:45,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:33:45,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:45,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:33:45,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:33:45,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:33:45,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:33:45,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:33:45,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:33:46,024 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:33:46,027 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:33:46,390 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:33:46,399 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:33:46,399 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:33:46,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:46 BoogieIcfgContainer [2022-11-02 20:33:46,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:33:46,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:33:46,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:33:46,411 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:33:46,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:33:45" (1/3) ... [2022-11-02 20:33:46,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d6792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:33:46, skipping insertion in model container [2022-11-02 20:33:46,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:33:45" (2/3) ... [2022-11-02 20:33:46,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2d6792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:33:46, skipping insertion in model container [2022-11-02 20:33:46,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:46" (3/3) ... [2022-11-02 20:33:46,416 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2022-11-02 20:33:46,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:33:46,442 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-11-02 20:33:46,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:33:46,552 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;@28ea1c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:33:46,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-11-02 20:33:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:33:46,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:46,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:46,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:46,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:46,614 INFO L85 PathProgramCache]: Analyzing trace with hash 123971630, now seen corresponding path program 1 times [2022-11-02 20:33:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:46,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505783438] [2022-11-02 20:33:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:47,200 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:33:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505783438] [2022-11-02 20:33:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505783438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090397028] [2022-11-02 20:33:47,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:47,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:47,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:47,271 INFO L87 Difference]: Start difference. First operand has 71 states, 53 states have (on average 1.849056603773585) internal successors, (98), 70 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:47,559 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-11-02 20:33:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:33:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:47,581 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:33:47,581 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:33:47,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:47,594 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 82 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:47,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 252 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:47,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:33:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2022-11-02 20:33:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 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:33:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-02 20:33:47,650 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2022-11-02 20:33:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:47,651 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-02 20:33:47,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-02 20:33:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:33:47,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:47,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:47,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:33:47,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash 120336139, now seen corresponding path program 1 times [2022-11-02 20:33:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:47,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873429406] [2022-11-02 20:33:47,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:47,763 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:33:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:47,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873429406] [2022-11-02 20:33:47,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873429406] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:47,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210857959] [2022-11-02 20:33:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:47,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:47,768 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:47,845 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-02 20:33:47,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:33:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:47,848 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:33:47,848 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:33:47,849 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:33:47,850 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 97 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:47,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 56 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:33:47,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-02 20:33:47,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-11-02 20:33:47,862 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2022-11-02 20:33:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:47,862 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-11-02 20:33:47,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:33:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-11-02 20:33:47,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:33:47,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:47,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:33:47,864 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash -564542931, now seen corresponding path program 1 times [2022-11-02 20:33:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552717220] [2022-11-02 20:33:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:47,983 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:33:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552717220] [2022-11-02 20:33:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552717220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:47,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684155328] [2022-11-02 20:33:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:47,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:47,987 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:33:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:48,065 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-11-02 20:33:48,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:48,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-02 20:33:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:48,067 INFO L225 Difference]: With dead ends: 69 [2022-11-02 20:33:48,067 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:33:48,067 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:33:48,069 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:48,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 117 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:33:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-02 20:33:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-02 20:33:48,080 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 9 [2022-11-02 20:33:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:48,081 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-02 20:33:48,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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:33:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-02 20:33:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:33:48,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:48,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:48,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:33:48,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash -429055130, now seen corresponding path program 1 times [2022-11-02 20:33:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448185588] [2022-11-02 20:33:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:48,236 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:33:48,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:48,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448185588] [2022-11-02 20:33:48,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448185588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:48,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:48,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:33:48,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171629514] [2022-11-02 20:33:48,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:48,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:33:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:48,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:48,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:48,246 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:33:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:48,440 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-11-02 20:33:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:48,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:33:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:48,448 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:33:48,448 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:33:48,449 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:33:48,451 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:48,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:33:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-11-02 20:33:48,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.36) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:48,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-11-02 20:33:48,464 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 11 [2022-11-02 20:33:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:48,465 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-11-02 20:33:48,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:33:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-11-02 20:33:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:33:48,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:48,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:48,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:33:48,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:48,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1359750351, now seen corresponding path program 1 times [2022-11-02 20:33:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039328763] [2022-11-02 20:33:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:48,603 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:33:48,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:48,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039328763] [2022-11-02 20:33:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039328763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:48,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:33:48,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005993272] [2022-11-02 20:33:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:48,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:33:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:48,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:48,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:48,617 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:33:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:48,754 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-02 20:33:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-02 20:33:48,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:48,756 INFO L225 Difference]: With dead ends: 65 [2022-11-02 20:33:48,756 INFO L226 Difference]: Without dead ends: 63 [2022-11-02 20:33:48,758 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:33:48,763 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:48,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 107 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-02 20:33:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-02 20:33:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-11-02 20:33:48,793 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 11 [2022-11-02 20:33:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:48,793 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-11-02 20:33:48,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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:33:48,796 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-11-02 20:33:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:33:48,798 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:48,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:48,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:33:48,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:48,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,801 INFO L85 PathProgramCache]: Analyzing trace with hash -415802953, now seen corresponding path program 1 times [2022-11-02 20:33:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591643841] [2022-11-02 20:33:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:48,891 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:33:48,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:48,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591643841] [2022-11-02 20:33:48,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591643841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:48,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:48,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:48,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662781913] [2022-11-02 20:33:48,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:48,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:48,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:48,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:48,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:48,895 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:48,974 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2022-11-02 20:33:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:33:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:48,976 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:33:48,976 INFO L226 Difference]: Without dead ends: 59 [2022-11-02 20:33:48,976 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:33:48,977 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 16 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:48,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-02 20:33:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-02 20:33:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 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:33:48,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-02 20:33:48,985 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2022-11-02 20:33:48,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:48,986 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-02 20:33:48,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-02 20:33:48,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:33:48,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:48,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:48,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:33:48,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash -415312395, now seen corresponding path program 1 times [2022-11-02 20:33:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839550308] [2022-11-02 20:33:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:49,081 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:33:49,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:49,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839550308] [2022-11-02 20:33:49,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839550308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:49,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:49,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:33:49,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244733170] [2022-11-02 20:33:49,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:49,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:33:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:49,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:49,085 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:49,264 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-11-02 20:33:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:33:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:49,265 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:33:49,265 INFO L226 Difference]: Without dead ends: 98 [2022-11-02 20:33:49,266 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:33:49,267 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 91 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:49,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 144 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-02 20:33:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2022-11-02 20:33:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 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:33:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-02 20:33:49,275 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 12 [2022-11-02 20:33:49,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:49,276 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-02 20:33:49,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-02 20:33:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:33:49,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:49,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:49,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:33:49,278 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 797416153, now seen corresponding path program 1 times [2022-11-02 20:33:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866118329] [2022-11-02 20:33:49,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:49,343 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:33:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:49,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866118329] [2022-11-02 20:33:49,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866118329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:49,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:49,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556345228] [2022-11-02 20:33:49,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:49,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:49,346 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:49,406 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-02 20:33:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-02 20:33:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:49,408 INFO L225 Difference]: With dead ends: 57 [2022-11-02 20:33:49,408 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:33:49,409 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:33:49,410 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:49,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:33:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-11-02 20:33:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 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:33:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-11-02 20:33:49,417 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 12 [2022-11-02 20:33:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:49,417 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-11-02 20:33:49,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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:33:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-11-02 20:33:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:33:49,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:49,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:49,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:33:49,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 10221853, now seen corresponding path program 1 times [2022-11-02 20:33:49,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:49,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600638048] [2022-11-02 20:33:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:49,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:49,621 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:33:49,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:49,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600638048] [2022-11-02 20:33:49,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600638048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:49,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:49,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612875346] [2022-11-02 20:33:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:49,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:49,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:49,624 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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:33:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:49,838 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-02 20:33:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:33:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-02 20:33:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:49,840 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:33:49,840 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:33:49,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:33:49,843 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 82 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:49,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 250 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:33:49,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 57. [2022-11-02 20:33:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 56 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:33:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-02 20:33:49,862 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 13 [2022-11-02 20:33:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:49,862 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-02 20:33:49,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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:33:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-02 20:33:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:33:49,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:49,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:49,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:33:49,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:49,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1032848570, now seen corresponding path program 1 times [2022-11-02 20:33:49,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:49,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287187003] [2022-11-02 20:33:49,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:49,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:49,980 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:33:49,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:49,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287187003] [2022-11-02 20:33:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287187003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:49,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:49,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:33:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419520727] [2022-11-02 20:33:49,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:49,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:33:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:49,983 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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:33:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:50,091 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-02 20:33:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:50,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-02 20:33:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:50,093 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:33:50,093 INFO L226 Difference]: Without dead ends: 72 [2022-11-02 20:33:50,093 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:33:50,094 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:50,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 103 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:50,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-02 20:33:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2022-11-02 20:33:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 54 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:33:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-02 20:33:50,102 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 13 [2022-11-02 20:33:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:50,102 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-02 20:33:50,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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:33:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-02 20:33:50,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:33:50,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:50,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:50,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:33:50,104 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1031124666, now seen corresponding path program 1 times [2022-11-02 20:33:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:50,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040287173] [2022-11-02 20:33:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:50,177 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:33:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:50,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040287173] [2022-11-02 20:33:50,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040287173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:50,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:50,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:33:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99712386] [2022-11-02 20:33:50,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:50,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:33:50,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:50,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:50,181 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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:33:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:50,273 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-11-02 20:33:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:50,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-02 20:33:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:50,274 INFO L225 Difference]: With dead ends: 55 [2022-11-02 20:33:50,274 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:33:50,275 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:33:50,276 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:50,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:33:50,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-02 20:33:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 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:33:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-02 20:33:50,283 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2022-11-02 20:33:50,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:50,283 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-02 20:33:50,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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:33:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-02 20:33:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:33:50,284 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:50,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:50,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:33:50,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:50,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash 310078394, now seen corresponding path program 1 times [2022-11-02 20:33:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:50,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546551432] [2022-11-02 20:33:50,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:50,439 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:33:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:50,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546551432] [2022-11-02 20:33:50,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546551432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:50,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:50,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:50,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770360249] [2022-11-02 20:33:50,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:50,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:50,441 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:50,563 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-11-02 20:33:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:33:50,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:33:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:50,566 INFO L225 Difference]: With dead ends: 78 [2022-11-02 20:33:50,566 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:33:50,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:50,567 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 85 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:50,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 85 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:33:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2022-11-02 20:33:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.288888888888889) internal successors, (58), 52 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:33:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-02 20:33:50,576 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 14 [2022-11-02 20:33:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:50,585 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-02 20:33:50,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:50,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-02 20:33:50,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:33:50,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:50,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:50,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:33:50,587 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:50,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:50,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1953530500, now seen corresponding path program 1 times [2022-11-02 20:33:50,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:50,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407299441] [2022-11-02 20:33:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:50,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:50,752 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:33:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:50,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407299441] [2022-11-02 20:33:50,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407299441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:50,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:50,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:50,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169150117] [2022-11-02 20:33:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:50,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:50,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:50,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:50,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:50,755 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:50,884 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-11-02 20:33:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:33:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:33:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:50,885 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:33:50,885 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:33:50,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:33:50,887 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 58 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:50,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 131 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:33:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2022-11-02 20:33:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-02 20:33:50,894 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 14 [2022-11-02 20:33:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:50,894 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-02 20:33:50,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-02 20:33:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:33:50,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:50,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:50,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:33:50,896 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:50,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1951983355, now seen corresponding path program 1 times [2022-11-02 20:33:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:50,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845612442] [2022-11-02 20:33:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:50,959 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:33:50,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:50,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845612442] [2022-11-02 20:33:50,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845612442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:50,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:50,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:33:50,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701857594] [2022-11-02 20:33:50,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:50,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:33:50,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:50,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:33:50,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:33:50,962 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:51,074 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-11-02 20:33:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:51,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:33:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:51,076 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:33:51,076 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 20:33:51,076 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:33:51,077 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:51,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 95 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 20:33:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2022-11-02 20:33:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-02 20:33:51,086 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2022-11-02 20:33:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:51,087 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-02 20:33:51,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-02 20:33:51,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:33:51,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:51,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:51,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:33:51,088 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:51,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:51,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1900089420, now seen corresponding path program 1 times [2022-11-02 20:33:51,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:51,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060300131] [2022-11-02 20:33:51,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:51,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:51,250 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:33:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:51,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060300131] [2022-11-02 20:33:51,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060300131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:51,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:51,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160303849] [2022-11-02 20:33:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:51,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:51,253 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:51,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:51,367 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-02 20:33:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:33:51,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-02 20:33:51,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:51,368 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:33:51,368 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 20:33:51,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:33:51,374 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:51,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 96 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 20:33:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-11-02 20:33:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-02 20:33:51,383 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2022-11-02 20:33:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:51,383 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-02 20:33:51,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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:33:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-02 20:33:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:33:51,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:51,385 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:51,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:33:51,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:51,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:51,386 INFO L85 PathProgramCache]: Analyzing trace with hash -381937728, now seen corresponding path program 1 times [2022-11-02 20:33:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:51,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941252679] [2022-11-02 20:33:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:51,607 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:33:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:51,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941252679] [2022-11-02 20:33:51,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941252679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:51,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:51,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897212567] [2022-11-02 20:33:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:51,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:51,614 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:33:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:51,748 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-11-02 20:33:51,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:33:51,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:33:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:51,750 INFO L225 Difference]: With dead ends: 87 [2022-11-02 20:33:51,750 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:33:51,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:33:51,751 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:51,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:51,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:33:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2022-11-02 20:33:51,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.25) internal successors, (70), 62 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-11-02 20:33:51,761 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 15 [2022-11-02 20:33:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:51,762 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-11-02 20:33:51,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:33:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-11-02 20:33:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:33:51,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:51,763 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:33:51,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:33:51,763 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash -441974753, now seen corresponding path program 1 times [2022-11-02 20:33:51,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:51,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175273657] [2022-11-02 20:33:51,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:51,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:51,860 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:33:51,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:51,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175273657] [2022-11-02 20:33:51,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175273657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:51,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:51,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:51,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203854754] [2022-11-02 20:33:51,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:51,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:51,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:51,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:51,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:51,864 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:33:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:51,903 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-11-02 20:33:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:33:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:51,904 INFO L225 Difference]: With dead ends: 63 [2022-11-02 20:33:51,905 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 20:33:51,905 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:33:51,906 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:51,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 64 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:51,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 20:33:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-02 20:33:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:51,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-02 20:33:51,915 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 16 [2022-11-02 20:33:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:51,917 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-02 20:33:51,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:33:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-02 20:33:51,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:33:51,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:51,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:51,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:33:51,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash -816311340, now seen corresponding path program 1 times [2022-11-02 20:33:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:51,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275445386] [2022-11-02 20:33:51,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:51,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:52,000 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:33:52,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:52,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275445386] [2022-11-02 20:33:52,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275445386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:52,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:52,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:33:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179345444] [2022-11-02 20:33:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:52,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:33:52,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:33:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:33:52,003 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:33:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:52,059 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-11-02 20:33:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:33:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-02 20:33:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:52,061 INFO L225 Difference]: With dead ends: 61 [2022-11-02 20:33:52,061 INFO L226 Difference]: Without dead ends: 57 [2022-11-02 20:33:52,062 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:33:52,063 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:52,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 86 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:33:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-02 20:33:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-02 20:33:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-11-02 20:33:52,073 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 17 [2022-11-02 20:33:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:52,073 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-11-02 20:33:52,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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:33:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-11-02 20:33:52,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:33:52,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:52,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:33:52,075 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:52,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -508949322, now seen corresponding path program 1 times [2022-11-02 20:33:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741320053] [2022-11-02 20:33:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:52,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:52,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741320053] [2022-11-02 20:33:52,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741320053] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:52,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120345218] [2022-11-02 20:33:52,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:52,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:52,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:52,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:52,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:33:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:52,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:33:52,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:52,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:33:52,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120345218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:52,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:52,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2022-11-02 20:33:52,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802154567] [2022-11-02 20:33:52,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:52,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:33:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:33:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:33:52,799 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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:33:53,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:53,132 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-02 20:33:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:33:53,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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:33:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:53,133 INFO L225 Difference]: With dead ends: 104 [2022-11-02 20:33:53,133 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:33:53,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:33:53,135 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 197 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:53,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 104 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:33:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:33:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 53. [2022-11-02 20:33:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 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:33:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-11-02 20:33:53,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 18 [2022-11-02 20:33:53,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:53,145 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-11-02 20:33:53,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 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:33:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-11-02 20:33:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:33:53,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:53,149 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:33:53,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:53,373 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash 479271318, now seen corresponding path program 1 times [2022-11-02 20:33:53,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:53,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854600115] [2022-11-02 20:33:53,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:53,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:53,612 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:33:53,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854600115] [2022-11-02 20:33:53,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854600115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:53,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:53,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:53,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507011777] [2022-11-02 20:33:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:53,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:53,614 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:33:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:53,763 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-02 20:33:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:33:53,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:33:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:53,765 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:33:53,765 INFO L226 Difference]: Without dead ends: 66 [2022-11-02 20:33:53,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:53,767 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 69 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:53,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 44 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-02 20:33:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 48. [2022-11-02 20:33:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 47 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:33:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-11-02 20:33:53,785 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 18 [2022-11-02 20:33:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:53,785 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-11-02 20:33:53,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:33:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-11-02 20:33:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:33:53,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:53,786 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:33:53,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:33:53,787 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:53,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash 397067279, now seen corresponding path program 1 times [2022-11-02 20:33:53,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:53,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649901209] [2022-11-02 20:33:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:53,963 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:33:53,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:53,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649901209] [2022-11-02 20:33:53,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649901209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:53,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:53,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279808709] [2022-11-02 20:33:53,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:53,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:53,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:53,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:53,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:53,966 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:33:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:54,099 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2022-11-02 20:33:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:33:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:33:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:54,101 INFO L225 Difference]: With dead ends: 60 [2022-11-02 20:33:54,101 INFO L226 Difference]: Without dead ends: 58 [2022-11-02 20:33:54,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:54,102 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:54,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 37 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-02 20:33:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-11-02 20:33:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-11-02 20:33:54,111 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 19 [2022-11-02 20:33:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:54,111 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-11-02 20:33:54,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:33:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-11-02 20:33:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:33:54,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:54,112 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:33:54,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:33:54,113 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 450508359, now seen corresponding path program 1 times [2022-11-02 20:33:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:54,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718951719] [2022-11-02 20:33:54,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:54,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:54,231 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:33:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:54,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718951719] [2022-11-02 20:33:54,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718951719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:54,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90765194] [2022-11-02 20:33:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:54,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:54,233 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:33:54,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:54,338 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-02 20:33:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:54,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:33:54,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:54,339 INFO L225 Difference]: With dead ends: 43 [2022-11-02 20:33:54,339 INFO L226 Difference]: Without dead ends: 20 [2022-11-02 20:33:54,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:33:54,340 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:54,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-02 20:33:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-11-02 20:33:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 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:33:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-11-02 20:33:54,345 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 19 [2022-11-02 20:33:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:54,345 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-11-02 20:33:54,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:33:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-11-02 20:33:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 20:33:54,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:54,346 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:54,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:33:54,346 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-11-02 20:33:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1395641153, now seen corresponding path program 1 times [2022-11-02 20:33:54,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:54,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377857267] [2022-11-02 20:33:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:54,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:33:54,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:54,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377857267] [2022-11-02 20:33:54,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377857267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:33:54,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894369087] [2022-11-02 20:33:54,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:54,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:54,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:33:54,489 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:33:54,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:33:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:54,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:33:54,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:33:54,813 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:33:54,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:33:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:33:54,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894369087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:33:54,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:33:54,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2022-11-02 20:33:54,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629437865] [2022-11-02 20:33:54,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:33:54,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:33:54,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:54,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:33:54,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:33:54,889 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:55,015 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-11-02 20:33:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:33:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 20:33:55,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:55,016 INFO L225 Difference]: With dead ends: 31 [2022-11-02 20:33:55,016 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:33:55,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:33:55,017 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:55,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 26 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:33:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:33:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:33:55,019 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:33:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:33:55,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-11-02 20:33:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:55,019 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:33:55,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:33:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:33:55,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:33:55,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 17 remaining) [2022-11-02 20:33:55,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 17 remaining) [2022-11-02 20:33:55,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (14 of 17 remaining) [2022-11-02 20:33:55,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (13 of 17 remaining) [2022-11-02 20:33:55,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 17 remaining) [2022-11-02 20:33:55,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (11 of 17 remaining) [2022-11-02 20:33:55,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (10 of 17 remaining) [2022-11-02 20:33:55,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (9 of 17 remaining) [2022-11-02 20:33:55,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (8 of 17 remaining) [2022-11-02 20:33:55,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2022-11-02 20:33:55,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (6 of 17 remaining) [2022-11-02 20:33:55,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (5 of 17 remaining) [2022-11-02 20:33:55,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (4 of 17 remaining) [2022-11-02 20:33:55,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (3 of 17 remaining) [2022-11-02 20:33:55,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (2 of 17 remaining) [2022-11-02 20:33:55,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (1 of 17 remaining) [2022-11-02 20:33:55,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (0 of 17 remaining) [2022-11-02 20:33:55,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:33:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:33:55,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:34:08,624 WARN L234 SmtUtils]: Spent 13.36s on a formula simplification. DAG size of input: 78 DAG size of output: 75 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:34:35,201 WARN L234 SmtUtils]: Spent 22.79s on a formula simplification. DAG size of input: 72 DAG size of output: 69 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 20:34:36,342 INFO L899 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2022-11-02 20:34:36,342 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-11-02 20:34:36,342 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2022-11-02 20:34:36,342 INFO L895 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-11-02 20:34:36,343 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2022-11-02 20:34:36,344 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2022-11-02 20:34:36,345 INFO L899 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2022-11-02 20:34:36,346 INFO L895 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_main_~main__t~0#1| 1))) (let ((.cse0 (let ((.cse3 (<= 1 |ULTIMATE.start_main_~main__t~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse3 .cse4) (and .cse3 .cse4 (not (= |ULTIMATE.start_main_~main__tagbuf_len~0#1| 0)) (< 0 (+ |ULTIMATE.start_main_~main__tagbuf_len~0#1| 1)) .cse1)))) (.cse2 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (or (and (or (= |ULTIMATE.start_main_~main__t~0#1| 0) (and .cse0 .cse1)) .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|) .cse2)))) [2022-11-02 20:34:36,346 INFO L895 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-02 20:34:36,346 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2022-11-02 20:34:36,346 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-11-02 20:34:36,346 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-11-02 20:34:36,346 INFO L899 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:34:36,347 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:34:36,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L899 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2022-11-02 20:34:36,349 INFO L902 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: true [2022-11-02 20:34:36,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2022-11-02 20:34:36,350 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2022-11-02 20:34:36,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2022-11-02 20:34:36,350 INFO L902 garLoopResultBuilder]: At program point L373(lines 15 375) the Hoare annotation is: true [2022-11-02 20:34:36,350 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2022-11-02 20:34:36,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2022-11-02 20:34:36,350 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2022-11-02 20:34:36,351 INFO L899 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2022-11-02 20:34:36,351 INFO L895 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (let ((.cse1 (let ((.cse2 (<= 0 |ULTIMATE.start_main_~main__t~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and .cse2 .cse3 .cse0) (and .cse2 .cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))))))) (or (and .cse0 .cse1 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) (and .cse1 (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|)) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1|))))) [2022-11-02 20:34:36,355 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:34:36,358 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:34:36,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:34:36 BoogieIcfgContainer [2022-11-02 20:34:36,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:34:36,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:34:36,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:34:36,392 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:34:36,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:33:46" (3/4) ... [2022-11-02 20:34:36,407 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:34:36,427 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 20:34:36,428 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:34:36,428 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:34:36,428 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:34:36,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:34:36,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:34:36,513 INFO L158 Benchmark]: Toolchain (without parser) took 51299.87ms. Allocated memory was 119.5MB in the beginning and 465.6MB in the end (delta: 346.0MB). Free memory was 86.2MB in the beginning and 420.5MB in the end (delta: -334.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,514 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:34:36,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.31ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 88.2MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.42ms. Allocated memory is still 119.5MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,516 INFO L158 Benchmark]: Boogie Preprocessor took 30.67ms. Allocated memory is still 119.5MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,516 INFO L158 Benchmark]: RCFGBuilder took 632.94ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 68.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,516 INFO L158 Benchmark]: TraceAbstraction took 49986.29ms. Allocated memory was 119.5MB in the beginning and 465.6MB in the end (delta: 346.0MB). Free memory was 68.1MB in the beginning and 424.7MB in the end (delta: -356.5MB). Peak memory consumption was 252.2MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,519 INFO L158 Benchmark]: Witness Printer took 120.81ms. Allocated memory is still 465.6MB. Free memory was 424.7MB in the beginning and 420.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:34:36,529 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.40ms. Allocated memory is still 92.3MB. Free memory was 43.1MB in the beginning and 43.0MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.31ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 88.2MB in the end (delta: -2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.42ms. Allocated memory is still 119.5MB. Free memory was 88.2MB in the beginning and 86.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.67ms. Allocated memory is still 119.5MB. Free memory was 86.1MB in the beginning and 84.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 632.94ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 68.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 49986.29ms. Allocated memory was 119.5MB in the beginning and 465.6MB in the end (delta: 346.0MB). Free memory was 68.1MB in the beginning and 424.7MB in the end (delta: -356.5MB). Peak memory consumption was 252.2MB. Max. memory is 16.1GB. * Witness Printer took 120.81ms. Allocated memory is still 465.6MB. Free memory was 424.7MB in the beginning and 420.5MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: 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: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: 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, 71 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 49.8s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 41.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1401 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1401 mSDsluCounter, 2402 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1448 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1728 IncrementalHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 954 mSDtfsCounter, 1728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 104 SyntacticMatches, 8 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 183 HoareAnnotationTreeSize, 6 FomulaSimplifications, 279332 FormulaSimplificationTreeSizeReduction, 40.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 465414 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 6 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t) && main__t <= main__tagbuf_len - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__t == 0 && (((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t == 0) || ((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && main__t < main__tagbuf_len) || (((((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && main__t == 0) || ((0 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && !(main__tagbuf_len <= main__t)) && 1 <= __VERIFIER_assert__cond) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__t == 0 || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) && main__t <= 1)) && main__t <= 1)) && main__t < main__tagbuf_len) || (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) || ((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == 0)) && 0 < main__tagbuf_len + 1) && main__t <= 1)) && 1 <= __VERIFIER_assert__cond) && main__t < main__tagbuf_len) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 20:34:36,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64798403-1353-426a-ac07-d15e9a7af082/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