./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:56:39,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:56:39,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:56:39,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:56:39,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:56:39,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:56:39,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:56:39,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:56:39,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:56:39,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:56:39,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:56:39,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:56:39,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:56:39,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:56:39,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:56:39,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:56:39,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:56:39,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:56:39,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:56:39,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:56:39,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:56:39,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:56:39,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:56:39,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:56:39,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:56:39,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:56:39,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:56:39,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:56:39,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:56:39,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:56:39,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:56:39,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:56:39,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:56:39,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:56:39,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:56:39,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:56:39,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:56:39,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:56:39,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:56:39,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:56:39,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:56:39,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:56:39,689 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:56:39,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:56:39,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:56:39,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:56:39,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:56:39,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:56:39,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:56:39,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:56:39,690 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:56:39,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:56:39,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:56:39,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:56:39,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:56:39,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:56:39,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:56:39,692 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:56:39,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:56:39,693 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:56:39,693 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_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/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_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2022-12-13 12:56:39,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:56:39,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:56:39,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:56:39,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:56:39,880 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:56:39,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-12-13 12:56:42,490 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:56:42,661 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:56:42,662 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-12-13 12:56:42,667 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/data/4a7eda92f/3777f9ee6bca466b8a750e3e2b9e8907/FLAG3060be677 [2022-12-13 12:56:43,061 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/data/4a7eda92f/3777f9ee6bca466b8a750e3e2b9e8907 [2022-12-13 12:56:43,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:56:43,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:56:43,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:56:43,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:56:43,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:56:43,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342e2069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43, skipping insertion in model container [2022-12-13 12:56:43,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:56:43,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:56:43,195 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-12-13 12:56:43,199 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-12-13 12:56:43,200 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-12-13 12:56:43,201 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-12-13 12:56:43,203 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-12-13 12:56:43,204 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-12-13 12:56:43,206 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-12-13 12:56:43,207 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-12-13 12:56:43,209 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-12-13 12:56:43,210 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-12-13 12:56:43,212 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-12-13 12:56:43,213 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-12-13 12:56:43,214 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-12-13 12:56:43,216 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-12-13 12:56:43,217 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-12-13 12:56:43,218 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-12-13 12:56:43,219 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-12-13 12:56:43,220 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-12-13 12:56:43,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:56:43,229 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:56:43,240 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-12-13 12:56:43,241 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-12-13 12:56:43,242 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-12-13 12:56:43,243 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-12-13 12:56:43,244 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-12-13 12:56:43,245 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-12-13 12:56:43,246 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-12-13 12:56:43,247 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-12-13 12:56:43,249 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-12-13 12:56:43,250 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-12-13 12:56:43,251 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-12-13 12:56:43,252 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-12-13 12:56:43,254 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-12-13 12:56:43,255 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-12-13 12:56:43,256 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-12-13 12:56:43,257 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-12-13 12:56:43,258 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-12-13 12:56:43,259 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_d269f875-4ff2-41dc-af61-b949ae3db15d/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-12-13 12:56:43,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:56:43,270 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:56:43,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43 WrapperNode [2022-12-13 12:56:43,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:56:43,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:56:43,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:56:43,271 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:56:43,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,297 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 254 [2022-12-13 12:56:43,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:56:43,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:56:43,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:56:43,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:56:43,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:56:43,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:56:43,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:56:43,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:56:43,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (1/1) ... [2022-12-13 12:56:43,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:56:43,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:56:43,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:56:43,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:56:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:56:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:56:43,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:56:43,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:56:43,425 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:56:43,426 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:56:43,629 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:56:43,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:56:43,636 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:56:43,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:43 BoogieIcfgContainer [2022-12-13 12:56:43,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:56:43,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:56:43,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:56:43,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:56:43,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:56:43" (1/3) ... [2022-12-13 12:56:43,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:56:43, skipping insertion in model container [2022-12-13 12:56:43,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:56:43" (2/3) ... [2022-12-13 12:56:43,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:56:43, skipping insertion in model container [2022-12-13 12:56:43,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:43" (3/3) ... [2022-12-13 12:56:43,645 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-12-13 12:56:43,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:56:43,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-13 12:56:43,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:56:43,702 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;@3f0ada54, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:56:43,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-12-13 12:56:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 12:56:43,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:43,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:43,710 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:43,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2022-12-13 12:56:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:43,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776130009] [2022-12-13 12:56:43,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:43,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:43,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776130009] [2022-12-13 12:56:43,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776130009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:43,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:43,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:56:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764111572] [2022-12-13 12:56:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:43,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:56:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:43,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:56:43,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:43,939 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:43,963 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-12-13 12:56:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:43,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 12:56:43,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:43,987 INFO L225 Difference]: With dead ends: 88 [2022-12-13 12:56:43,988 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 12:56:43,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:43,993 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 12:56:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-13 12:56:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-12-13 12:56:44,029 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2022-12-13 12:56:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,029 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-12-13 12:56:44,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-12-13 12:56:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 12:56:44,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:56:44,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2022-12-13 12:56:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700618065] [2022-12-13 12:56:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:44,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700618065] [2022-12-13 12:56:44,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700618065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:44,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:44,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:56:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087582165] [2022-12-13 12:56:44,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:44,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:56:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:44,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:56:44,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:56:44,143 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:44,211 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-12-13 12:56:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 12:56:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:44,212 INFO L225 Difference]: With dead ends: 76 [2022-12-13 12:56:44,212 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 12:56:44,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:44,213 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 252 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 80 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 12:56:44,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-12-13 12:56:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-12-13 12:56:44,219 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2022-12-13 12:56:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,219 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-12-13 12:56:44,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-12-13 12:56:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 12:56:44,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:56:44,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2022-12-13 12:56:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042811836] [2022-12-13 12:56:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:44,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:44,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042811836] [2022-12-13 12:56:44,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042811836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:44,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:44,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:56:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034201896] [2022-12-13 12:56:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:44,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:44,293 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:44,343 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-12-13 12:56:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 12:56:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:44,344 INFO L225 Difference]: With dead ends: 97 [2022-12-13 12:56:44,344 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 12:56:44,345 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-12-13 12:56:44,346 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 112 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 120 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 12:56:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2022-12-13 12:56:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-12-13 12:56:44,351 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2022-12-13 12:56:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,352 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-12-13 12:56:44,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-12-13 12:56:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 12:56:44,353 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:56:44,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2022-12-13 12:56:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955617864] [2022-12-13 12:56:44,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:44,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955617864] [2022-12-13 12:56:44,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955617864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:44,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:44,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797475649] [2022-12-13 12:56:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:44,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:44,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:44,415 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:44,457 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-12-13 12:56:44,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 12:56:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:44,458 INFO L225 Difference]: With dead ends: 72 [2022-12-13 12:56:44,458 INFO L226 Difference]: Without dead ends: 70 [2022-12-13 12:56:44,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:44,459 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 170 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 77 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-12-13 12:56:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-12-13 12:56:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-12-13 12:56:44,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2022-12-13 12:56:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,465 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-12-13 12:56:44,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-12-13 12:56:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 12:56:44,466 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:56:44,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2022-12-13 12:56:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872718739] [2022-12-13 12:56:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:44,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:44,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872718739] [2022-12-13 12:56:44,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872718739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:44,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:44,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:44,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678089683] [2022-12-13 12:56:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:44,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:44,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:44,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:44,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:44,533 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:44,642 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2022-12-13 12:56:44,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:56:44,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 12:56:44,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:44,643 INFO L225 Difference]: With dead ends: 106 [2022-12-13 12:56:44,643 INFO L226 Difference]: Without dead ends: 104 [2022-12-13 12:56:44,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:44,644 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 123 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 171 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:56:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-12-13 12:56:44,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 74. [2022-12-13 12:56:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-12-13 12:56:44,653 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 22 [2022-12-13 12:56:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,654 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-12-13 12:56:44,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-12-13 12:56:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 12:56:44,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:56:44,655 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2022-12-13 12:56:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224291600] [2022-12-13 12:56:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224291600] [2022-12-13 12:56:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224291600] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:44,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363875856] [2022-12-13 12:56:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:44,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:44,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:44,732 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:44,837 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2022-12-13 12:56:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:56:44,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 12:56:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:44,839 INFO L225 Difference]: With dead ends: 133 [2022-12-13 12:56:44,839 INFO L226 Difference]: Without dead ends: 131 [2022-12-13 12:56:44,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:44,840 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 122 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 291 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:56:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-13 12:56:44,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 75. [2022-12-13 12:56:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-12-13 12:56:44,850 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2022-12-13 12:56:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,850 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-12-13 12:56:44,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,850 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-12-13 12:56:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 12:56:44,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:56:44,851 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2022-12-13 12:56:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095368340] [2022-12-13 12:56:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:44,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095368340] [2022-12-13 12:56:44,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095368340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:44,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:44,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687480200] [2022-12-13 12:56:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:44,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:44,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:44,919 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:44,969 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-12-13 12:56:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:44,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 12:56:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:44,970 INFO L225 Difference]: With dead ends: 75 [2022-12-13 12:56:44,970 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 12:56:44,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:44,972 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 138 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:44,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 98 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 12:56:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-12-13 12:56:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-12-13 12:56:44,980 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2022-12-13 12:56:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:44,981 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-12-13 12:56:44,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-12-13 12:56:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 12:56:44,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:44,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:44,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:56:44,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2022-12-13 12:56:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:44,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352508060] [2022-12-13 12:56:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:45,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:45,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352508060] [2022-12-13 12:56:45,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352508060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:45,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:45,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682493144] [2022-12-13 12:56:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:45,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:45,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:45,049 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:45,125 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-12-13 12:56:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:45,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 12:56:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:45,127 INFO L225 Difference]: With dead ends: 113 [2022-12-13 12:56:45,127 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 12:56:45,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:45,128 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 145 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:45,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 12:56:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2022-12-13 12:56:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-12-13 12:56:45,135 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2022-12-13 12:56:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:45,135 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-12-13 12:56:45,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,136 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-12-13 12:56:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 12:56:45,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:45,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:45,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:56:45,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:45,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2022-12-13 12:56:45,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:45,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490664480] [2022-12-13 12:56:45,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:45,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490664480] [2022-12-13 12:56:45,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490664480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:45,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:45,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:56:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996152718] [2022-12-13 12:56:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:45,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:56:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:56:45,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:45,164 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:45,203 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-12-13 12:56:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:56:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 12:56:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:45,204 INFO L225 Difference]: With dead ends: 111 [2022-12-13 12:56:45,204 INFO L226 Difference]: Without dead ends: 71 [2022-12-13 12:56:45,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:56:45,205 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:45,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-12-13 12:56:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-12-13 12:56:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-12-13 12:56:45,213 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2022-12-13 12:56:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:45,213 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-12-13 12:56:45,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-12-13 12:56:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 12:56:45,214 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:45,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:45,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:56:45,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:45,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2022-12-13 12:56:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:45,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128267081] [2022-12-13 12:56:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128267081] [2022-12-13 12:56:45,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128267081] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574460057] [2022-12-13 12:56:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:45,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:56:45,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:56:45,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:56:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 12:56:45,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:45,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:45,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574460057] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:56:45,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:56:45,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-12-13 12:56:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095272436] [2022-12-13 12:56:45,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:45,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:56:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:45,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:56:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:56:45,447 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:45,527 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-12-13 12:56:45,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:45,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 12:56:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:45,528 INFO L225 Difference]: With dead ends: 111 [2022-12-13 12:56:45,528 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 12:56:45,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:45,529 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 133 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:45,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 171 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:56:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 12:56:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2022-12-13 12:56:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-12-13 12:56:45,536 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2022-12-13 12:56:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:45,537 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-12-13 12:56:45,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-12-13 12:56:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 12:56:45,537 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:45,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:45,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:56:45,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:45,738 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2022-12-13 12:56:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:45,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406987362] [2022-12-13 12:56:45,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:45,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:45,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406987362] [2022-12-13 12:56:45,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406987362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:45,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:45,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:45,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562090968] [2022-12-13 12:56:45,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:45,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:45,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:45,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:45,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:45,812 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:45,857 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-12-13 12:56:45,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:45,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-13 12:56:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:45,858 INFO L225 Difference]: With dead ends: 69 [2022-12-13 12:56:45,858 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 12:56:45,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:45,859 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:45,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 12:56:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-12-13 12:56:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-12-13 12:56:45,865 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-12-13 12:56:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:45,865 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-12-13 12:56:45,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-12-13 12:56:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 12:56:45,866 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:45,866 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:45,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:56:45,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:45,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2022-12-13 12:56:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:45,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038548501] [2022-12-13 12:56:45,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038548501] [2022-12-13 12:56:45,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038548501] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:45,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623066888] [2022-12-13 12:56:45,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:45,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:45,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:56:45,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:56:45,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:56:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:45,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 12:56:45,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:46,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:46,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:56:46,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623066888] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:56:46,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:56:46,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-12-13 12:56:46,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141174492] [2022-12-13 12:56:46,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:46,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:56:46,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:46,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:56:46,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:56:46,060 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:46,101 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-12-13 12:56:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:46,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 12:56:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:46,102 INFO L225 Difference]: With dead ends: 67 [2022-12-13 12:56:46,102 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 12:56:46,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:46,103 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 77 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:46,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 90 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 12:56:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-12-13 12:56:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-12-13 12:56:46,108 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2022-12-13 12:56:46,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:46,108 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-12-13 12:56:46,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-12-13 12:56:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 12:56:46,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:46,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:46,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 12:56:46,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:46,311 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2022-12-13 12:56:46,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:46,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967946622] [2022-12-13 12:56:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967946622] [2022-12-13 12:56:46,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967946622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:46,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:46,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725740625] [2022-12-13 12:56:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:46,490 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:46,531 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-12-13 12:56:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-13 12:56:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:46,532 INFO L225 Difference]: With dead ends: 60 [2022-12-13 12:56:46,532 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 12:56:46,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:46,533 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:46,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 12:56:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 12:56:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-12-13 12:56:46,538 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2022-12-13 12:56:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:46,539 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-12-13 12:56:46,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-12-13 12:56:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 12:56:46,540 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:46,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:46,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:56:46,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2022-12-13 12:56:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:46,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139407837] [2022-12-13 12:56:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:46,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:46,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:46,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139407837] [2022-12-13 12:56:46,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139407837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:46,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:46,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:46,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937197036] [2022-12-13 12:56:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:46,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:46,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:46,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:46,628 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:46,672 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-12-13 12:56:46,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:46,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 12:56:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:46,673 INFO L225 Difference]: With dead ends: 59 [2022-12-13 12:56:46,673 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 12:56:46,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:46,674 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 57 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:46,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:46,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 12:56:46,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-12-13 12:56:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-12-13 12:56:46,689 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2022-12-13 12:56:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:46,689 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-12-13 12:56:46,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-12-13 12:56:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-13 12:56:46,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:46,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:46,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:56:46,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2022-12-13 12:56:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338871516] [2022-12-13 12:56:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:46,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:46,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338871516] [2022-12-13 12:56:46,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338871516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:46,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:46,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:56:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180255111] [2022-12-13 12:56:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:46,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:56:46,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:56:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:56:46,744 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:46,805 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-12-13 12:56:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-13 12:56:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:46,806 INFO L225 Difference]: With dead ends: 67 [2022-12-13 12:56:46,806 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 12:56:46,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:56:46,807 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 103 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:46,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 86 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 12:56:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-12-13 12:56:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-12-13 12:56:46,813 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2022-12-13 12:56:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:46,813 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-12-13 12:56:46,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,813 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-12-13 12:56:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-13 12:56:46,814 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:46,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:46,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:56:46,814 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:46,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2022-12-13 12:56:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:46,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145568338] [2022-12-13 12:56:46,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:46,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:46,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:46,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145568338] [2022-12-13 12:56:46,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145568338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:46,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:46,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755638600] [2022-12-13 12:56:46,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:46,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:46,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:46,882 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:46,957 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-12-13 12:56:46,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:56:46,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-12-13 12:56:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:46,958 INFO L225 Difference]: With dead ends: 87 [2022-12-13 12:56:46,958 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 12:56:46,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:46,959 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:46,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 117 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 12:56:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2022-12-13 12:56:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-12-13 12:56:46,965 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2022-12-13 12:56:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:46,966 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-12-13 12:56:46,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-12-13 12:56:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 12:56:46,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:46,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:46,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:56:46,967 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2022-12-13 12:56:46,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:46,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221692482] [2022-12-13 12:56:46,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221692482] [2022-12-13 12:56:47,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221692482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:47,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:47,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706566220] [2022-12-13 12:56:47,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:47,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:47,019 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:47,070 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-12-13 12:56:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:47,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-13 12:56:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:47,070 INFO L225 Difference]: With dead ends: 57 [2022-12-13 12:56:47,071 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 12:56:47,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:47,071 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:47,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 109 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 12:56:47,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 12:56:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-12-13 12:56:47,075 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2022-12-13 12:56:47,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:47,075 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-12-13 12:56:47,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-12-13 12:56:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 12:56:47,076 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:47,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:47,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:56:47,077 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:47,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2022-12-13 12:56:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:47,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54448812] [2022-12-13 12:56:47,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:47,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:47,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54448812] [2022-12-13 12:56:47,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54448812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:47,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:47,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:56:47,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516003075] [2022-12-13 12:56:47,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:56:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:56:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:56:47,154 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:47,182 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-12-13 12:56:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:47,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-13 12:56:47,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:47,183 INFO L225 Difference]: With dead ends: 66 [2022-12-13 12:56:47,184 INFO L226 Difference]: Without dead ends: 64 [2022-12-13 12:56:47,184 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-12-13 12:56:47,184 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:47,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-13 12:56:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-12-13 12:56:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-12-13 12:56:47,190 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2022-12-13 12:56:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:47,190 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-12-13 12:56:47,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-12-13 12:56:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 12:56:47,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:47,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:47,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:56:47,191 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2022-12-13 12:56:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:47,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242172640] [2022-12-13 12:56:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:47,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242172640] [2022-12-13 12:56:47,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242172640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:47,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:47,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:47,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574427419] [2022-12-13 12:56:47,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:47,249 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:47,274 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-12-13 12:56:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-13 12:56:47,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:47,275 INFO L225 Difference]: With dead ends: 62 [2022-12-13 12:56:47,275 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 12:56:47,276 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-12-13 12:56:47,276 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:47,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 12:56:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-12-13 12:56:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-12-13 12:56:47,283 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2022-12-13 12:56:47,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:47,283 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-12-13 12:56:47,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-12-13 12:56:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 12:56:47,284 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:47,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:47,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:56:47,284 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:47,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2022-12-13 12:56:47,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:47,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431250406] [2022-12-13 12:56:47,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:47,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431250406] [2022-12-13 12:56:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431250406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:47,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:47,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92607773] [2022-12-13 12:56:47,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:47,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:47,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:47,338 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:47,422 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-12-13 12:56:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:56:47,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-12-13 12:56:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:47,423 INFO L225 Difference]: With dead ends: 84 [2022-12-13 12:56:47,423 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 12:56:47,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:47,424 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:47,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 12:56:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2022-12-13 12:56:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-12-13 12:56:47,431 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2022-12-13 12:56:47,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:47,431 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-12-13 12:56:47,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-12-13 12:56:47,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 12:56:47,432 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:47,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:47,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:56:47,432 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:47,433 INFO L85 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2022-12-13 12:56:47,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:47,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100272311] [2022-12-13 12:56:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:47,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100272311] [2022-12-13 12:56:47,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100272311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:47,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:47,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329854260] [2022-12-13 12:56:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:47,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:47,495 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:47,563 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-12-13 12:56:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:56:47,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-12-13 12:56:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:47,564 INFO L225 Difference]: With dead ends: 69 [2022-12-13 12:56:47,564 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 12:56:47,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:56:47,565 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:47,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:47,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 12:56:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-12-13 12:56:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-12-13 12:56:47,571 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2022-12-13 12:56:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:47,572 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-12-13 12:56:47,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-12-13 12:56:47,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-13 12:56:47,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:47,573 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:47,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 12:56:47,573 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:47,573 INFO L85 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2022-12-13 12:56:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:47,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423736907] [2022-12-13 12:56:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:47,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423736907] [2022-12-13 12:56:47,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423736907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:56:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774360211] [2022-12-13 12:56:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:47,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:56:47,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:56:47,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:56:47,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:56:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:47,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 12:56:47,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:56:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:56:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:56:47,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774360211] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:56:47,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:56:47,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-12-13 12:56:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184168789] [2022-12-13 12:56:47,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:56:47,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:56:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:56:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:56:47,814 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:47,861 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-12-13 12:56:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:56:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-12-13 12:56:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:47,862 INFO L225 Difference]: With dead ends: 54 [2022-12-13 12:56:47,862 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 12:56:47,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:47,863 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:47,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:47,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 12:56:47,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-12-13 12:56:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-12-13 12:56:47,868 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2022-12-13 12:56:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:47,868 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-12-13 12:56:47,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-12-13 12:56:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 12:56:47,868 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:56:47,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:56:47,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 12:56:48,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 12:56:48,069 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 12:56:48,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:56:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2022-12-13 12:56:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:56:48,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922501613] [2022-12-13 12:56:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:56:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:56:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:56:48,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 12:56:48,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:56:48,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922501613] [2022-12-13 12:56:48,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922501613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:56:48,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:56:48,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:56:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956201036] [2022-12-13 12:56:48,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:56:48,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:56:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:56:48,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:56:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:56:48,140 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:56:48,228 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-12-13 12:56:48,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:56:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-12-13 12:56:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:56:48,229 INFO L225 Difference]: With dead ends: 71 [2022-12-13 12:56:48,229 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 12:56:48,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:56:48,230 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:56:48,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:56:48,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 12:56:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 12:56:48,231 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-12-13 12:56:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 12:56:48,231 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-12-13 12:56:48,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:56:48,231 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 12:56:48,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:56:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 12:56:48,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 12:56:48,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-12-13 12:56:48,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-12-13 12:56:48,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-12-13 12:56:48,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-12-13 12:56:48,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-12-13 12:56:48,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-12-13 12:56:48,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-12-13 12:56:48,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-12-13 12:56:48,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-12-13 12:56:48,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:56:48,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 12:57:06,118 WARN L233 SmtUtils]: Spent 14.35s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-12-13 12:57:06,836 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-12-13 12:57:06,837 INFO L895 garLoopResultBuilder]: At program point L137(lines 131 402) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse5 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)))))) [2022-12-13 12:57:06,837 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-12-13 12:57:06,837 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-12-13 12:57:06,837 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-12-13 12:57:06,837 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-12-13 12:57:06,838 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-12-13 12:57:06,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-12-13 12:57:06,838 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-12-13 12:57:06,838 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-12-13 12:57:06,838 INFO L899 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-12-13 12:57:06,840 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-12-13 12:57:06,840 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-12-13 12:57:06,840 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-12-13 12:57:06,841 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-12-13 12:57:06,842 INFO L895 garLoopResultBuilder]: At program point $Ultimate##56(lines 232 343) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse4 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse6 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse7 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse9 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 1)) (.cse11 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse16 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))) (.cse1 (= |ULTIMATE.start_main_~main__c~0#1| 0))) (or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (let ((.cse0 (let ((.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)))) (or (and .cse2 .cse3 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse14 .cse15))))) (or (and .cse0 .cse1) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0))) .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1) .cse11 .cse12 .cse16 .cse13 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) .cse14 .cse15 .cse1))) [2022-12-13 12:57:06,842 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-12-13 12:57:06,842 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-12-13 12:57:06,843 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-12-13 12:57:06,844 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 13 439) the Hoare annotation is: true [2022-12-13 12:57:06,844 INFO L895 garLoopResultBuilder]: At program point $Ultimate##34(lines 131 402) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse6 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse4 .cse5 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 1) .cse6))) [2022-12-13 12:57:06,844 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-12-13 12:57:06,844 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-12-13 12:57:06,844 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-12-13 12:57:06,844 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 12:57:06,844 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-12-13 12:57:06,844 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 12:57:06,845 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-12-13 12:57:06,846 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-12-13 12:57:06,847 INFO L899 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-12-13 12:57:06,847 INFO L895 garLoopResultBuilder]: At program point L164(lines 162 359) the Hoare annotation is: (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) [2022-12-13 12:57:06,847 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-12-13 12:57:06,847 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 12:57:06,847 INFO L895 garLoopResultBuilder]: At program point L313(lines 262 328) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (let ((.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse5 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse6 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 1)) (.cse7 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse8 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))) (.cse11 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse13 .cse14))))) (or (and .cse0 (= |ULTIMATE.start_main_~main__c~0#1| 0)) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) .cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))))) [2022-12-13 12:57:06,847 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-12-13 12:57:06,847 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-12-13 12:57:06,848 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-12-13 12:57:06,848 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-12-13 12:57:06,848 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-12-13 12:57:06,848 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-12-13 12:57:06,850 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, 1, 1, 1, 1] [2022-12-13 12:57:06,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:57:06,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:57:06 BoogieIcfgContainer [2022-12-13 12:57:06,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:57:06,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:57:06,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:57:06,867 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:57:06,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:56:43" (3/4) ... [2022-12-13 12:57:06,870 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 12:57:06,878 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 12:57:06,879 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 12:57:06,879 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 12:57:06,879 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 12:57:06,912 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 12:57:06,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:57:06,913 INFO L158 Benchmark]: Toolchain (without parser) took 23849.06ms. Allocated memory was 148.9MB in the beginning and 358.6MB in the end (delta: 209.7MB). Free memory was 115.8MB in the beginning and 320.4MB in the end (delta: -204.7MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,913 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:57:06,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.77ms. Allocated memory is still 148.9MB. Free memory was 115.1MB in the beginning and 95.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.93ms. Allocated memory is still 148.9MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,913 INFO L158 Benchmark]: Boogie Preprocessor took 17.27ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,914 INFO L158 Benchmark]: RCFGBuilder took 322.83ms. Allocated memory is still 148.9MB. Free memory was 92.0MB in the beginning and 74.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,914 INFO L158 Benchmark]: TraceAbstraction took 23226.48ms. Allocated memory was 148.9MB in the beginning and 358.6MB in the end (delta: 209.7MB). Free memory was 73.8MB in the beginning and 325.7MB in the end (delta: -251.8MB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,914 INFO L158 Benchmark]: Witness Printer took 45.05ms. Allocated memory is still 358.6MB. Free memory was 324.6MB in the beginning and 320.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:57:06,916 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.17ms. Allocated memory is still 94.4MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.77ms. Allocated memory is still 148.9MB. Free memory was 115.1MB in the beginning and 95.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.93ms. Allocated memory is still 148.9MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.27ms. Allocated memory is still 148.9MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.83ms. Allocated memory is still 148.9MB. Free memory was 92.0MB in the beginning and 74.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23226.48ms. Allocated memory was 148.9MB in the beginning and 358.6MB in the end (delta: 209.7MB). Free memory was 73.8MB in the beginning and 325.7MB in the end (delta: -251.8MB). Peak memory consumption was 172.4MB. Max. memory is 16.1GB. * Witness Printer took 45.05ms. Allocated memory is still 358.6MB. Free memory was 324.6MB in the beginning and 320.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2091 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2091 mSDsluCounter, 2729 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1486 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1182 IncrementalHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 1243 mSDtfsCounter, 1182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 212 SyntacticMatches, 19 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 295 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 685 HoareAnnotationTreeSize, 6 FomulaSimplifications, 65140 FormulaSimplificationTreeSizeReduction, 17.9s HoareSimplificationTime, 6 FomulaSimplificationsInter, 321118 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 1798 SizeOfPredicates, 12 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 && (((((((!(__VERIFIER_assert__cond == 0) && !(main__urilen <= main__cp)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) && !(main__urilen <= main__cp)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) || ((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(main__scheme <= 0)) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && main__cp + 1 < main__urilen) && (((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && (((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))))) && __VERIFIER_assert__cond == 1) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) RESULT: Ultimate proved your program to be correct! [2022-12-13 12:57:06,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d269f875-4ff2-41dc-af61-b949ae3db15d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE