./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R --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 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --- 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-38b53e6 [2022-11-25 17:53:51,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:53:51,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:53:51,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:53:51,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:53:51,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:53:51,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:53:51,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:53:51,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:53:51,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:53:51,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:53:51,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:53:51,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:53:51,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:53:51,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:53:51,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:53:51,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:53:51,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:53:51,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:53:51,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:53:51,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:53:51,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:53:51,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:53:51,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:53:51,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:53:51,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:53:51,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:53:51,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:53:51,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:53:51,594 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:53:51,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:53:51,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:53:51,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:53:51,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:53:51,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:53:51,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:53:51,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:53:51,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:53:51,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:53:51,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:53:51,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:53:51,602 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:53:51,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:53:51,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:53:51,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:53:51,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:53:51,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:53:51,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:53:51,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:53:51,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:53:51,628 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:53:51,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:53:51,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:53:51,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:53:51,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:53:51,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:53:51,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:53:51,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:53:51,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:53:51,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:53:51,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:53:51,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:53:51,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:53:51,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:53:51,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:53:51,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:53:51,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:53:51,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:53:51,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:53:51,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:53:51,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:53:51,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:53:51,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:53:51,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:53:51,633 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:53:51,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:53:51,634 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/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_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R 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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 [2022-11-25 17:53:51,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:53:51,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:53:51,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:53:51,938 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:53:51,938 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:53:51,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-11-25 17:53:55,050 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:53:55,326 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:53:55,327 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-11-25 17:53:55,340 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/data/91430ee93/7e954f6d3606453fa5694f2a4e620517/FLAG46b8682a7 [2022-11-25 17:53:55,354 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/data/91430ee93/7e954f6d3606453fa5694f2a4e620517 [2022-11-25 17:53:55,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:53:55,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:53:55,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:53:55,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:53:55,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:53:55,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:55,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afedd6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55, skipping insertion in model container [2022-11-25 17:53:55,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:55,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:53:55,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:53:55,635 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-11-25 17:53:55,647 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-11-25 17:53:55,653 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-11-25 17:53:55,654 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-11-25 17:53:55,657 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-11-25 17:53:55,658 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-11-25 17:53:55,660 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-11-25 17:53:55,662 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-11-25 17:53:55,663 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-11-25 17:53:55,665 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-11-25 17:53:55,671 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-11-25 17:53:55,672 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-11-25 17:53:55,749 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-11-25 17:53:55,763 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-11-25 17:53:55,768 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-11-25 17:53:55,772 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-11-25 17:53:55,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:53:55,801 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:53:55,826 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-11-25 17:53:55,831 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-11-25 17:53:55,848 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-11-25 17:53:55,849 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-11-25 17:53:55,851 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-11-25 17:53:55,852 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-11-25 17:53:55,854 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-11-25 17:53:55,855 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-11-25 17:53:55,856 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-11-25 17:53:55,858 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-11-25 17:53:55,860 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-11-25 17:53:55,861 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-11-25 17:53:55,890 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-11-25 17:53:55,892 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-11-25 17:53:55,894 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-11-25 17:53:55,896 WARN L237 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_457c9daf-4b02-4e06-90ea-cffbf80ece66/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-11-25 17:53:55,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:53:55,913 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:53:55,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55 WrapperNode [2022-11-25 17:53:55,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:53:55,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:53:55,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:53:55,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:53:55,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:55,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:55,981 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2022-11-25 17:53:55,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:53:55,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:53:55,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:53:55,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:53:56,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,052 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:53:56,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:53:56,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:53:56,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:53:56,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (1/1) ... [2022-11-25 17:53:56,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:53:56,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:53:56,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:53:56,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:53:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:53:56,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:53:56,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:53:56,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:53:56,328 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:53:56,330 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:53:56,974 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:53:56,981 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:53:56,982 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:53:56,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:53:56 BoogieIcfgContainer [2022-11-25 17:53:56,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:53:56,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:53:56,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:53:56,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:53:56,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:53:55" (1/3) ... [2022-11-25 17:53:56,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c2f451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:53:56, skipping insertion in model container [2022-11-25 17:53:56,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:55" (2/3) ... [2022-11-25 17:53:56,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c2f451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:53:56, skipping insertion in model container [2022-11-25 17:53:56,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:53:56" (3/3) ... [2022-11-25 17:53:56,994 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-11-25 17:53:57,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:53:57,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-25 17:53:57,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:53:57,115 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;@ed542f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:53:57,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:53:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 0 states have call successors, (0), 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-25 17:53:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 17:53:57,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:57,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:57,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2022-11-25 17:53:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:57,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595980455] [2022-11-25 17:53:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:57,416 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-25 17:53:57,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:57,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595980455] [2022-11-25 17:53:57,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595980455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:57,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:57,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:53:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626393094] [2022-11-25 17:53:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:57,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:53:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:53:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:53:57,479 INFO L87 Difference]: Start difference. First operand has 120 states, 103 states have (on average 1.912621359223301) internal successors, (197), 119 states have internal predecessors, (197), 0 states have call successors, (0), 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 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 17:53:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:53:57,804 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2022-11-25 17:53:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:53:57,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 17:53:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:53:57,818 INFO L225 Difference]: With dead ends: 131 [2022-11-25 17:53:57,818 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 17:53:57,822 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-25 17:53:57,825 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 160 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:53:57,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 175 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:53:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 17:53:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-25 17:53:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 113 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2022-11-25 17:53:57,870 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2022-11-25 17:53:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:53:57,871 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2022-11-25 17:53:57,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-25 17:53:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2022-11-25 17:53:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 17:53:57,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:57,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:57,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:53:57,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2022-11-25 17:53:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:57,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466716478] [2022-11-25 17:53:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:58,023 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-25 17:53:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:58,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466716478] [2022-11-25 17:53:58,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466716478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:58,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:58,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:53:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909439182] [2022-11-25 17:53:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:58,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:58,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:58,029 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-25 17:53:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:53:58,245 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2022-11-25 17:53:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:53:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-25 17:53:58,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:53:58,247 INFO L225 Difference]: With dead ends: 114 [2022-11-25 17:53:58,247 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 17:53:58,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:53:58,249 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 32 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:53:58,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 268 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:53:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 17:53:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-25 17:53:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 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-25 17:53:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2022-11-25 17:53:58,258 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2022-11-25 17:53:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:53:58,259 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2022-11-25 17:53:58,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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-25 17:53:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2022-11-25 17:53:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 17:53:58,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:58,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:58,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:53:58,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2022-11-25 17:53:58,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:58,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012638399] [2022-11-25 17:53:58,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:58,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:58,443 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-25 17:53:58,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:58,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012638399] [2022-11-25 17:53:58,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012638399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:58,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:58,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:53:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14077289] [2022-11-25 17:53:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:58,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:58,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:58,450 INFO L87 Difference]: Start difference. First operand 109 states and 121 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-25 17:53:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:53:58,730 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-11-25 17:53:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:58,731 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-25 17:53:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:53:58,732 INFO L225 Difference]: With dead ends: 109 [2022-11-25 17:53:58,732 INFO L226 Difference]: Without dead ends: 107 [2022-11-25 17:53:58,733 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-25 17:53:58,734 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:53:58,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:53:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-25 17:53:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-25 17:53:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 106 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2022-11-25 17:53:58,742 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2022-11-25 17:53:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:53:58,743 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2022-11-25 17:53:58,743 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-25 17:53:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2022-11-25 17:53:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 17:53:58,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:58,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:58,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:53:58,745 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2022-11-25 17:53:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:58,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883351701] [2022-11-25 17:53:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:58,822 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-25 17:53:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:58,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883351701] [2022-11-25 17:53:58,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883351701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:58,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:58,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:53:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717726811] [2022-11-25 17:53:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:58,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:53:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:58,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:53:58,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:53:58,825 INFO L87 Difference]: Start difference. First operand 107 states and 119 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-25 17:53:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:53:58,974 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-25 17:53:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:53:58,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-25 17:53:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:53:58,975 INFO L225 Difference]: With dead ends: 107 [2022-11-25 17:53:58,975 INFO L226 Difference]: Without dead ends: 103 [2022-11-25 17:53:58,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-25 17:53:58,977 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:53:58,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 242 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:53:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-25 17:53:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-25 17:53:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 102 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2022-11-25 17:53:58,984 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2022-11-25 17:53:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:53:58,984 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2022-11-25 17:53:58,984 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-25 17:53:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2022-11-25 17:53:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:53:58,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:58,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:58,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:53:58,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:58,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:58,987 INFO L85 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2022-11-25 17:53:58,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:58,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575193765] [2022-11-25 17:53:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:59,070 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-25 17:53:59,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:59,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575193765] [2022-11-25 17:53:59,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575193765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:59,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:59,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:53:59,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984022618] [2022-11-25 17:53:59,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:59,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:59,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:59,073 INFO L87 Difference]: Start difference. First operand 103 states and 115 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-25 17:53:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:53:59,317 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2022-11-25 17:53:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:59,317 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-25 17:53:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:53:59,318 INFO L225 Difference]: With dead ends: 121 [2022-11-25 17:53:59,318 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 17:53:59,319 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-25 17:53:59,320 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 112 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:53:59,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 111 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:53:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 17:53:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2022-11-25 17:53:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 100 states have internal predecessors, (113), 0 states have call successors, (0), 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-25 17:53:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-11-25 17:53:59,326 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2022-11-25 17:53:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:53:59,326 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-11-25 17:53:59,327 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-25 17:53:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-11-25 17:53:59,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 17:53:59,328 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:59,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:59,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:53:59,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:59,329 INFO L85 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2022-11-25 17:53:59,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:59,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969917403] [2022-11-25 17:53:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:59,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:59,417 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-25 17:53:59,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:59,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969917403] [2022-11-25 17:53:59,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969917403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:59,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:59,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:53:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476636333] [2022-11-25 17:53:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:59,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:59,424 INFO L87 Difference]: Start difference. First operand 101 states and 113 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-25 17:53:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:53:59,651 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2022-11-25 17:53:59,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:59,651 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-25 17:53:59,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:53:59,652 INFO L225 Difference]: With dead ends: 101 [2022-11-25 17:53:59,652 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 17:53:59,653 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-25 17:53:59,654 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 83 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:53:59,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 83 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:53:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 17:53:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-25 17:53:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.247191011235955) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 17:53:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-11-25 17:53:59,659 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2022-11-25 17:53:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:53:59,660 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-11-25 17:53:59,660 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-25 17:53:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-11-25 17:53:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:53:59,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:53:59,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:59,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:53:59,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:53:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2022-11-25 17:53:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:59,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390725759] [2022-11-25 17:53:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:59,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:59,915 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-25 17:53:59,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:59,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390725759] [2022-11-25 17:53:59,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390725759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:59,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:59,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:53:59,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439160610] [2022-11-25 17:53:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:59,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:53:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:53:59,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:53:59,918 INFO L87 Difference]: Start difference. First operand 99 states and 111 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-25 17:54:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:00,196 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-25 17:54:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:54:00,196 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-25 17:54:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:00,203 INFO L225 Difference]: With dead ends: 136 [2022-11-25 17:54:00,204 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 17:54:00,204 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-25 17:54:00,205 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:00,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 296 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 17:54:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2022-11-25 17:54:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-25 17:54:00,213 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 14 [2022-11-25 17:54:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:00,214 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-25 17:54:00,214 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-25 17:54:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-25 17:54:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:54:00,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:00,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:00,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:54:00,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2022-11-25 17:54:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:00,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773552512] [2022-11-25 17:54:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:00,284 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-25 17:54:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:00,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773552512] [2022-11-25 17:54:00,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773552512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:00,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:00,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:54:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115399568] [2022-11-25 17:54:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:00,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:54:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:54:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:54:00,287 INFO L87 Difference]: Start difference. First operand 105 states and 119 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-25 17:54:00,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:00,536 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-11-25 17:54:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:54:00,537 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-25 17:54:00,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:00,537 INFO L225 Difference]: With dead ends: 126 [2022-11-25 17:54:00,538 INFO L226 Difference]: Without dead ends: 124 [2022-11-25 17:54:00,538 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-25 17:54:00,539 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 103 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:00,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 103 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:00,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-25 17:54:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2022-11-25 17:54:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 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-25 17:54:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2022-11-25 17:54:00,546 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 14 [2022-11-25 17:54:00,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:00,546 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2022-11-25 17:54:00,547 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-25 17:54:00,547 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2022-11-25 17:54:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:54:00,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:00,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:00,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:54:00,548 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2022-11-25 17:54:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:00,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728406150] [2022-11-25 17:54:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:00,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:00,698 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-25 17:54:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728406150] [2022-11-25 17:54:00,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728406150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:00,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:00,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:54:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106887938] [2022-11-25 17:54:00,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:00,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:00,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:00,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:00,700 INFO L87 Difference]: Start difference. First operand 103 states and 117 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-25 17:54:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:00,958 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2022-11-25 17:54:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:54:00,959 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-25 17:54:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:00,960 INFO L225 Difference]: With dead ends: 113 [2022-11-25 17:54:00,960 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 17:54:00,960 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-25 17:54:00,961 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 17 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:00,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 245 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 17:54:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2022-11-25 17:54:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 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-25 17:54:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-25 17:54:00,966 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 14 [2022-11-25 17:54:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:00,967 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-25 17:54:00,967 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-25 17:54:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-25 17:54:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:54:00,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:00,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:00,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:54:00,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:00,969 INFO L85 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2022-11-25 17:54:00,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:00,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716787298] [2022-11-25 17:54:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:00,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:01,109 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-25 17:54:01,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716787298] [2022-11-25 17:54:01,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716787298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:01,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:01,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:54:01,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553946534] [2022-11-25 17:54:01,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:01,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:01,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:01,112 INFO L87 Difference]: Start difference. First operand 104 states and 118 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-25 17:54:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:01,335 INFO L93 Difference]: Finished difference Result 131 states and 147 transitions. [2022-11-25 17:54:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:54:01,335 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-25 17:54:01,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:01,336 INFO L225 Difference]: With dead ends: 131 [2022-11-25 17:54:01,336 INFO L226 Difference]: Without dead ends: 129 [2022-11-25 17:54:01,337 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-25 17:54:01,337 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:01,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 274 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-25 17:54:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2022-11-25 17:54:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 98 states have (on average 1.2346938775510203) internal successors, (121), 106 states have internal predecessors, (121), 0 states have call successors, (0), 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-25 17:54:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-11-25 17:54:01,342 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 15 [2022-11-25 17:54:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:01,343 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-11-25 17:54:01,343 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-25 17:54:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-11-25 17:54:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:54:01,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:01,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:01,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:54:01,344 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2022-11-25 17:54:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:01,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274757311] [2022-11-25 17:54:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:01,459 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-25 17:54:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274757311] [2022-11-25 17:54:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274757311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:01,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:01,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:54:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997247880] [2022-11-25 17:54:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:01,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:54:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:01,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:54:01,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:54:01,463 INFO L87 Difference]: Start difference. First operand 107 states and 121 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-25 17:54:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:01,533 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2022-11-25 17:54:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:54:01,534 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-25 17:54:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:01,535 INFO L225 Difference]: With dead ends: 107 [2022-11-25 17:54:01,535 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 17:54:01,536 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-25 17:54:01,537 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 97 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:01,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 138 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:54:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 17:54:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-11-25 17:54:01,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-25 17:54:01,542 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 16 [2022-11-25 17:54:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:01,544 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-25 17:54:01,545 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-25 17:54:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-25 17:54:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:54:01,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:01,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:01,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:54:01,550 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:01,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2022-11-25 17:54:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:01,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679921677] [2022-11-25 17:54:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:01,690 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-25 17:54:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:01,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679921677] [2022-11-25 17:54:01,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679921677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:01,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:01,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:54:01,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636376073] [2022-11-25 17:54:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:01,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:54:01,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:01,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:54:01,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:54:01,692 INFO L87 Difference]: Start difference. First operand 105 states and 119 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-25 17:54:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:01,829 INFO L93 Difference]: Finished difference Result 105 states and 119 transitions. [2022-11-25 17:54:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:54:01,829 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-25 17:54:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:01,830 INFO L225 Difference]: With dead ends: 105 [2022-11-25 17:54:01,830 INFO L226 Difference]: Without dead ends: 101 [2022-11-25 17:54:01,831 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-25 17:54:01,831 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:01,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:54:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-25 17:54:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-11-25 17:54:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 100 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2022-11-25 17:54:01,836 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 17 [2022-11-25 17:54:01,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:01,837 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2022-11-25 17:54:01,837 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-25 17:54:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2022-11-25 17:54:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 17:54:01,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:01,838 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-25 17:54:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:54:01,838 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:01,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1418456853, now seen corresponding path program 1 times [2022-11-25 17:54:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:01,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441861595] [2022-11-25 17:54:01,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:01,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:02,001 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-25 17:54:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:02,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441861595] [2022-11-25 17:54:02,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441861595] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:02,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:02,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:54:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655810875] [2022-11-25 17:54:02,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:02,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:02,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:02,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:02,004 INFO L87 Difference]: Start difference. First operand 101 states and 115 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-25 17:54:02,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:02,279 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2022-11-25 17:54:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:54:02,279 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-25 17:54:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:02,280 INFO L225 Difference]: With dead ends: 116 [2022-11-25 17:54:02,280 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 17:54:02,281 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-25 17:54:02,281 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 155 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:02,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 57 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 17:54:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2022-11-25 17:54:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 96 states have internal predecessors, (111), 0 states have call successors, (0), 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-25 17:54:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 111 transitions. [2022-11-25 17:54:02,287 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 111 transitions. Word has length 18 [2022-11-25 17:54:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:02,287 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 111 transitions. [2022-11-25 17:54:02,287 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-25 17:54:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-11-25 17:54:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 17:54:02,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:02,288 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-25 17:54:02,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:54:02,288 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1471897933, now seen corresponding path program 1 times [2022-11-25 17:54:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122113198] [2022-11-25 17:54:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:02,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:02,395 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-25 17:54:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:02,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122113198] [2022-11-25 17:54:02,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122113198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:02,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:02,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:54:02,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105687354] [2022-11-25 17:54:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:02,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:02,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:02,398 INFO L87 Difference]: Start difference. First operand 97 states and 111 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-25 17:54:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:02,646 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-11-25 17:54:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:54:02,646 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-25 17:54:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:02,647 INFO L225 Difference]: With dead ends: 97 [2022-11-25 17:54:02,647 INFO L226 Difference]: Without dead ends: 93 [2022-11-25 17:54:02,648 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-25 17:54:02,648 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:02,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 44 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-25 17:54:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-25 17:54:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 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-25 17:54:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2022-11-25 17:54:02,653 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 18 [2022-11-25 17:54:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:02,654 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2022-11-25 17:54:02,654 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-25 17:54:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2022-11-25 17:54:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 17:54:02,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:02,654 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-25 17:54:02,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:54:02,655 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1159129958, now seen corresponding path program 1 times [2022-11-25 17:54:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726875508] [2022-11-25 17:54:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:02,757 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-25 17:54:02,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:02,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726875508] [2022-11-25 17:54:02,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726875508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:02,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:02,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:54:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568018706] [2022-11-25 17:54:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:02,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:02,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:02,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:02,760 INFO L87 Difference]: Start difference. First operand 93 states and 107 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-25 17:54:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:03,003 INFO L93 Difference]: Finished difference Result 103 states and 119 transitions. [2022-11-25 17:54:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:54:03,005 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-25 17:54:03,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:03,005 INFO L225 Difference]: With dead ends: 103 [2022-11-25 17:54:03,006 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 17:54:03,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-25 17:54:03,007 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 135 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:03,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 47 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:54:03,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 17:54:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 17:54:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.08) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-11-25 17:54:03,010 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 18 [2022-11-25 17:54:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:03,010 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-11-25 17:54:03,010 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-25 17:54:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-11-25 17:54:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 17:54:03,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:03,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:03,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:54:03,012 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2022-11-25 17:54:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:03,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705576936] [2022-11-25 17:54:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:03,295 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-25 17:54:03,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:03,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705576936] [2022-11-25 17:54:03,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705576936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:03,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:03,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 17:54:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399986972] [2022-11-25 17:54:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:54:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:54:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:54:03,300 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:03,446 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-11-25 17:54:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:54:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 17:54:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:03,449 INFO L225 Difference]: With dead ends: 54 [2022-11-25 17:54:03,450 INFO L226 Difference]: Without dead ends: 52 [2022-11-25 17:54:03,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:54:03,451 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:03,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:54:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-25 17:54:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-25 17:54:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-11-25 17:54:03,455 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2022-11-25 17:54:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:03,455 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-11-25 17:54:03,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-11-25 17:54:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 17:54:03,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:03,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:03,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:54:03,460 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2022-11-25 17:54:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:03,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883838688] [2022-11-25 17:54:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:03,759 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-25 17:54:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:03,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883838688] [2022-11-25 17:54:03,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883838688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:03,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:03,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-25 17:54:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223962645] [2022-11-25 17:54:03,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:03,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:54:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:54:03,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:54:03,763 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:03,910 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-11-25 17:54:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 17:54:03,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-25 17:54:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:03,911 INFO L225 Difference]: With dead ends: 59 [2022-11-25 17:54:03,912 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 17:54:03,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:54:03,913 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:03,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 27 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:54:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 17:54:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2022-11-25 17:54:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-11-25 17:54:03,916 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2022-11-25 17:54:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:03,916 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-11-25 17:54:03,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-11-25 17:54:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:54:03,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:03,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:03,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:54:03,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2022-11-25 17:54:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:03,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488593931] [2022-11-25 17:54:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:04,388 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-25 17:54:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:04,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488593931] [2022-11-25 17:54:04,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488593931] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:04,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:04,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:54:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286001567] [2022-11-25 17:54:04,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:54:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:54:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:54:04,393 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-25 17:54:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:04,489 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-11-25 17:54:04,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:54:04,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 17:54:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:04,491 INFO L225 Difference]: With dead ends: 50 [2022-11-25 17:54:04,491 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 17:54:04,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:54:04,494 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:04,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:54:04,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 17:54:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-25 17:54:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 0 states have call successors, (0), 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-25 17:54:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-11-25 17:54:04,497 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2022-11-25 17:54:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:04,498 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-11-25 17:54:04,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-25 17:54:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-11-25 17:54:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 17:54:04,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:54:04,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:04,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:54:04,500 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-25 17:54:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:04,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2022-11-25 17:54:04,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:04,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684364288] [2022-11-25 17:54:04,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:04,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:04,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:05,020 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-25 17:54:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:05,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684364288] [2022-11-25 17:54:05,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684364288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:05,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:05,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:54:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577924365] [2022-11-25 17:54:05,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:05,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:54:05,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:05,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:54:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:54:05,023 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-25 17:54:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:54:05,132 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-11-25 17:54:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:54:05,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 17:54:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:54:05,133 INFO L225 Difference]: With dead ends: 50 [2022-11-25 17:54:05,133 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:54:05,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:54:05,134 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:54:05,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:54:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:54:05,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:54:05,136 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-25 17:54:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:54:05,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-25 17:54:05,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:54:05,136 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:54:05,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-25 17:54:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:54:05,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:54:05,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-11-25 17:54:05,140 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-11-25 17:54:05,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-11-25 17:54:05,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-11-25 17:54:05,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-11-25 17:54:05,141 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-11-25 17:54:05,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-11-25 17:54:05,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-11-25 17:54:05,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-11-25 17:54:05,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-11-25 17:54:05,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-11-25 17:54:05,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-11-25 17:54:05,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-11-25 17:54:05,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-11-25 17:54:05,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-11-25 17:54:05,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-11-25 17:54:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:54:05,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:54:05,310 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-11-25 17:54:05,310 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-11-25 17:54:05,310 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-11-25 17:54:05,311 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-11-25 17:54:05,311 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-11-25 17:54:05,311 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-11-25 17:54:05,311 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-11-25 17:54:05,311 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-11-25 17:54:05,311 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-11-25 17:54:05,312 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:54:05,312 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-11-25 17:54:05,312 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-11-25 17:54:05,312 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-11-25 17:54:05,312 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-11-25 17:54:05,312 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-11-25 17:54:05,313 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-11-25 17:54:05,313 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-11-25 17:54:05,313 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-25 17:54:05,313 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-11-25 17:54:05,313 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-11-25 17:54:05,313 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-11-25 17:54:05,314 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-11-25 17:54:05,314 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-11-25 17:54:05,314 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-11-25 17:54:05,314 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-11-25 17:54:05,314 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-11-25 17:54:05,315 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-11-25 17:54:05,315 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-11-25 17:54:05,315 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-11-25 17:54:05,315 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-11-25 17:54:05,315 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-11-25 17:54:05,315 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-11-25 17:54:05,316 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-11-25 17:54:05,316 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-11-25 17:54:05,316 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-11-25 17:54:05,316 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-11-25 17:54:05,316 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-11-25 17:54:05,316 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-11-25 17:54:05,317 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-11-25 17:54:05,317 INFO L902 garLoopResultBuilder]: At program point L932(lines 17 1006) the Hoare annotation is: true [2022-11-25 17:54:05,317 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-11-25 17:54:05,317 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-11-25 17:54:05,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-11-25 17:54:05,318 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-11-25 17:54:05,318 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-11-25 17:54:05,318 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-11-25 17:54:05,318 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-25 17:54:05,318 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-11-25 17:54:05,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:54:05,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-11-25 17:54:05,319 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-25 17:54:05,319 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-11-25 17:54:05,319 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-11-25 17:54:05,319 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-11-25 17:54:05,319 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-25 17:54:05,320 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-11-25 17:54:05,320 INFO L895 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-25 17:54:05,320 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-11-25 17:54:05,320 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-11-25 17:54:05,320 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-11-25 17:54:05,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-11-25 17:54:05,321 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-11-25 17:54:05,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-11-25 17:54:05,321 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-11-25 17:54:05,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-11-25 17:54:05,322 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-11-25 17:54:05,322 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-11-25 17:54:05,322 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-11-25 17:54:05,322 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-11-25 17:54:05,322 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-11-25 17:54:05,322 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-11-25 17:54:05,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-11-25 17:54:05,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:54:05,323 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-11-25 17:54:05,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-11-25 17:54:05,323 INFO L895 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 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-25 17:54:05,324 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-11-25 17:54:05,324 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-11-25 17:54:05,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-11-25 17:54:05,324 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-25 17:54:05,324 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-11-25 17:54:05,324 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-11-25 17:54:05,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-11-25 17:54:05,325 INFO L902 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: true [2022-11-25 17:54:05,325 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-11-25 17:54:05,325 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-11-25 17:54:05,325 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-11-25 17:54:05,325 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-11-25 17:54:05,326 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-11-25 17:54:05,326 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-11-25 17:54:05,326 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-11-25 17:54:05,326 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-11-25 17:54:05,326 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-25 17:54:05,326 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-11-25 17:54:05,327 INFO L895 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-25 17:54:05,327 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-11-25 17:54:05,327 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-11-25 17:54:05,327 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-11-25 17:54:05,327 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-11-25 17:54:05,327 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:54:05,328 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-11-25 17:54:05,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-11-25 17:54:05,328 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-11-25 17:54:05,328 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-11-25 17:54:05,328 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-11-25 17:54:05,328 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-11-25 17:54:05,329 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-11-25 17:54:05,329 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-11-25 17:54:05,329 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-11-25 17:54:05,329 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-11-25 17:54:05,329 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-11-25 17:54:05,329 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-11-25 17:54:05,330 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-11-25 17:54:05,330 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-11-25 17:54:05,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-11-25 17:54:05,330 INFO L895 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (<= 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-25 17:54:05,330 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-11-25 17:54:05,330 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-11-25 17:54:05,331 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-11-25 17:54:05,331 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-11-25 17:54:05,334 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:05,337 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:54:05,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:54:05 BoogieIcfgContainer [2022-11-25 17:54:05,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:54:05,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:54:05,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:54:05,361 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:54:05,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:53:56" (3/4) ... [2022-11-25 17:54:05,365 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:54:05,391 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 17:54:05,392 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 17:54:05,393 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:54:05,394 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:54:05,488 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:54:05,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:54:05,489 INFO L158 Benchmark]: Toolchain (without parser) took 10121.54ms. Allocated memory was 153.1MB in the beginning and 276.8MB in the end (delta: 123.7MB). Free memory was 107.6MB in the beginning and 127.7MB in the end (delta: -20.1MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,489 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:54:05,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.29ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 84.5MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.29ms. Allocated memory is still 153.1MB. Free memory was 84.5MB in the beginning and 81.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,490 INFO L158 Benchmark]: Boogie Preprocessor took 74.75ms. Allocated memory is still 153.1MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,491 INFO L158 Benchmark]: RCFGBuilder took 917.33ms. Allocated memory was 153.1MB in the beginning and 228.6MB in the end (delta: 75.5MB). Free memory was 78.7MB in the beginning and 178.9MB in the end (delta: -100.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,491 INFO L158 Benchmark]: TraceAbstraction took 8373.47ms. Allocated memory was 228.6MB in the beginning and 276.8MB in the end (delta: 48.2MB). Free memory was 178.0MB in the beginning and 137.2MB in the end (delta: 40.8MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,492 INFO L158 Benchmark]: Witness Printer took 127.78ms. Allocated memory is still 276.8MB. Free memory was 137.2MB in the beginning and 127.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 17:54:05,493 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.29ms. Allocated memory is still 153.1MB. Free memory is still 97.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.29ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 84.5MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.29ms. Allocated memory is still 153.1MB. Free memory was 84.5MB in the beginning and 81.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.75ms. Allocated memory is still 153.1MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 917.33ms. Allocated memory was 153.1MB in the beginning and 228.6MB in the end (delta: 75.5MB). Free memory was 78.7MB in the beginning and 178.9MB in the end (delta: -100.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8373.47ms. Allocated memory was 228.6MB in the beginning and 276.8MB in the end (delta: 48.2MB). Free memory was 178.0MB in the beginning and 137.2MB in the end (delta: 40.8MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 127.78ms. Allocated memory is still 276.8MB. Free memory was 137.2MB in the beginning and 127.7MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: 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, 120 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1331 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1331 mSDsluCounter, 2483 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1445 mSDsCounter, 262 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3638 IncrementalHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 262 mSolverCounterUnsat, 1038 mSDtfsCounter, 3638 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 31 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4434 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 211 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 1313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 16 specifications checked. All of them hold - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 <= main__t && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 17:54:05,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_457c9daf-4b02-4e06-90ea-cffbf80ece66/bin/uautomizer-ZsLfNo2U6R/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