./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93c2f95927688290d9634a76e5cb5c078ca9f28d9ebb5a85520405b4d17220b1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:20:19,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:20:19,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:20:19,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:20:19,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:20:19,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:20:19,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:20:19,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:20:19,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:20:19,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:20:19,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:20:19,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:20:19,500 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:20:19,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:20:19,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:20:19,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:20:19,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:20:19,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:20:19,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:20:19,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:20:19,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:20:19,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:20:19,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:20:19,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:20:19,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:20:19,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:20:19,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:20:19,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:20:19,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:20:19,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:20:19,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:20:19,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:20:19,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:20:19,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:20:19,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:20:19,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:20:19,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:20:19,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:20:19,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:20:19,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:20:19,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:20:19,554 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:20:19,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:20:19,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:20:19,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:20:19,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:20:19,603 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:20:19,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:20:19,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:20:19,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:20:19,604 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:20:19,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:20:19,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:20:19,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:20:19,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:20:19,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:20:19,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:20:19,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:20:19,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:20:19,607 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:20:19,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:20:19,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:20:19,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:20:19,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:20:19,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:20:19,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:20:19,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:19,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:20:19,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:20:19,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:20:19,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:20:19,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:20:19,610 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:20:19,610 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:20:19,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:20:19,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93c2f95927688290d9634a76e5cb5c078ca9f28d9ebb5a85520405b4d17220b1 [2022-11-02 20:20:19,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:20:19,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:20:19,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:20:19,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:20:19,950 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:20:19,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-11-02 20:20:20,048 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/data/abeaf2058/98176b492cd84a7aa159043f1820ec29/FLAGa2ecdf5c9 [2022-11-02 20:20:20,784 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:20:20,785 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-11-02 20:20:20,806 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/data/abeaf2058/98176b492cd84a7aa159043f1820ec29/FLAGa2ecdf5c9 [2022-11-02 20:20:21,034 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/data/abeaf2058/98176b492cd84a7aa159043f1820ec29 [2022-11-02 20:20:21,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:20:21,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:20:21,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:21,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:20:21,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:20:21,046 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fc794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21, skipping insertion in model container [2022-11-02 20:20:21,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:20:21,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:20:21,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c[911,924] [2022-11-02 20:20:21,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c[8416,8429] [2022-11-02 20:20:21,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:21,528 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:20:21,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c[911,924] [2022-11-02 20:20:21,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.09.cil-1.c[8416,8429] [2022-11-02 20:20:21,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:20:21,675 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:20:21,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21 WrapperNode [2022-11-02 20:20:21,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:20:21,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:21,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:20:21,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:20:21,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,765 INFO L138 Inliner]: procedures = 73, calls = 88, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 904 [2022-11-02 20:20:21,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:20:21,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:20:21,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:20:21,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:20:21,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:20:21,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:20:21,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:20:21,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:20:21,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (1/1) ... [2022-11-02 20:20:21,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:20:21,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:21,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:20:21,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a1980ba4-ba59-4014-89fb-a04fe04f0d64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:20:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:20:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:20:21,972 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:20:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 20:20:21,974 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 20:20:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-02 20:20:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-02 20:20:21,976 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-02 20:20:21,976 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-02 20:20:21,976 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-02 20:20:21,977 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-02 20:20:21,977 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-02 20:20:21,977 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-02 20:20:21,977 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-02 20:20:21,977 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-02 20:20:21,977 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-02 20:20:21,978 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-02 20:20:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 20:20:21,978 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 20:20:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-02 20:20:21,978 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-02 20:20:21,978 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-02 20:20:21,979 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-02 20:20:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:20:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-02 20:20:21,979 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-02 20:20:21,979 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-02 20:20:21,980 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-02 20:20:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:20:21,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:20:21,980 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-02 20:20:21,980 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-02 20:20:22,130 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:20:22,133 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:20:23,128 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-02 20:20:23,128 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-02 20:20:23,224 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:20:23,238 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:20:23,238 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-02 20:20:23,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:23 BoogieIcfgContainer [2022-11-02 20:20:23,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:20:23,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:20:23,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:20:23,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:20:23,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:20:21" (1/3) ... [2022-11-02 20:20:23,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2fc7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:23, skipping insertion in model container [2022-11-02 20:20:23,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:20:21" (2/3) ... [2022-11-02 20:20:23,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c2fc7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:20:23, skipping insertion in model container [2022-11-02 20:20:23,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:20:23" (3/3) ... [2022-11-02 20:20:23,253 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.09.cil-1.c [2022-11-02 20:20:23,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:20:23,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:20:23,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:20:23,394 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;@831a20d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:20:23,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:20:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 368 states have (on average 1.625) internal successors, (598), 374 states have internal predecessors, (598), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-02 20:20:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:20:23,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:23,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:23,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1177923463, now seen corresponding path program 1 times [2022-11-02 20:20:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:23,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223208656] [2022-11-02 20:20:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:20:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:20:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223208656] [2022-11-02 20:20:23,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223208656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:23,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:23,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195594872] [2022-11-02 20:20:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:23,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:23,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:24,024 INFO L87 Difference]: Start difference. First operand has 424 states, 368 states have (on average 1.625) internal successors, (598), 374 states have internal predecessors, (598), 39 states have call successors, (39), 14 states have call predecessors, (39), 14 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:25,195 INFO L93 Difference]: Finished difference Result 842 states and 1340 transitions. [2022-11-02 20:20:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 20:20:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:25,214 INFO L225 Difference]: With dead ends: 842 [2022-11-02 20:20:25,214 INFO L226 Difference]: Without dead ends: 432 [2022-11-02 20:20:25,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:25,224 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 669 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:25,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1741 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:20:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-11-02 20:20:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2022-11-02 20:20:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 360 states have (on average 1.5361111111111112) internal successors, (553), 364 states have internal predecessors, (553), 39 states have call successors, (39), 14 states have call predecessors, (39), 13 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-02 20:20:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2022-11-02 20:20:25,320 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 65 [2022-11-02 20:20:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:25,321 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2022-11-02 20:20:25,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2022-11-02 20:20:25,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:20:25,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:25,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:25,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:20:25,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:25,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1137248713, now seen corresponding path program 1 times [2022-11-02 20:20:25,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:25,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997088808] [2022-11-02 20:20:25,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:25,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:20:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:20:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:25,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997088808] [2022-11-02 20:20:25,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997088808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:25,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:25,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:25,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473055829] [2022-11-02 20:20:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:25,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:25,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:25,611 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:26,956 INFO L93 Difference]: Finished difference Result 669 states and 998 transitions. [2022-11-02 20:20:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:20:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 20:20:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:26,961 INFO L225 Difference]: With dead ends: 669 [2022-11-02 20:20:26,961 INFO L226 Difference]: Without dead ends: 565 [2022-11-02 20:20:26,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:26,964 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 1394 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:26,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1401 Valid, 1881 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:20:26,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-02 20:20:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 526. [2022-11-02 20:20:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 450 states have (on average 1.508888888888889) internal successors, (679), 456 states have internal predecessors, (679), 52 states have call successors, (52), 21 states have call predecessors, (52), 22 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2022-11-02 20:20:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 786 transitions. [2022-11-02 20:20:27,026 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 786 transitions. Word has length 65 [2022-11-02 20:20:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:27,026 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 786 transitions. [2022-11-02 20:20:27,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 786 transitions. [2022-11-02 20:20:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:20:27,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:27,030 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:27,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:20:27,031 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1619378553, now seen corresponding path program 1 times [2022-11-02 20:20:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:27,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862423655] [2022-11-02 20:20:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:20:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:20:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:27,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862423655] [2022-11-02 20:20:27,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862423655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:27,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:27,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:27,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53423602] [2022-11-02 20:20:27,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:27,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:27,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:27,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:27,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:27,417 INFO L87 Difference]: Start difference. First operand 526 states and 786 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:29,100 INFO L93 Difference]: Finished difference Result 923 states and 1351 transitions. [2022-11-02 20:20:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:20:29,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 20:20:29,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:29,107 INFO L225 Difference]: With dead ends: 923 [2022-11-02 20:20:29,107 INFO L226 Difference]: Without dead ends: 714 [2022-11-02 20:20:29,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:20:29,110 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 1216 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:29,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 2491 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:20:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-11-02 20:20:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 638. [2022-11-02 20:20:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 540 states have (on average 1.488888888888889) internal successors, (804), 548 states have internal predecessors, (804), 65 states have call successors, (65), 28 states have call predecessors, (65), 31 states have return successors, (76), 65 states have call predecessors, (76), 63 states have call successors, (76) [2022-11-02 20:20:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 945 transitions. [2022-11-02 20:20:29,218 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 945 transitions. Word has length 65 [2022-11-02 20:20:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:29,219 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 945 transitions. [2022-11-02 20:20:29,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 945 transitions. [2022-11-02 20:20:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:20:29,233 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:29,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:29,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:20:29,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:29,236 INFO L85 PathProgramCache]: Analyzing trace with hash 647002633, now seen corresponding path program 1 times [2022-11-02 20:20:29,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:29,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570501455] [2022-11-02 20:20:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:29,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:20:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:20:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:20:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:29,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:29,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570501455] [2022-11-02 20:20:29,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570501455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:29,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:29,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:20:29,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530545645] [2022-11-02 20:20:29,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:29,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:29,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:29,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:29,518 INFO L87 Difference]: Start difference. First operand 638 states and 945 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-02 20:20:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:32,551 INFO L93 Difference]: Finished difference Result 2184 states and 3142 transitions. [2022-11-02 20:20:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:20:32,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-11-02 20:20:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:32,573 INFO L225 Difference]: With dead ends: 2184 [2022-11-02 20:20:32,578 INFO L226 Difference]: Without dead ends: 1851 [2022-11-02 20:20:32,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:20:32,585 INFO L413 NwaCegarLoop]: 765 mSDtfsCounter, 3313 mSDsluCounter, 2070 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3331 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:32,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3331 Valid, 2835 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:20:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2022-11-02 20:20:32,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1691. [2022-11-02 20:20:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1388 states have (on average 1.404899135446686) internal successors, (1950), 1411 states have internal predecessors, (1950), 175 states have call successors, (175), 111 states have call predecessors, (175), 126 states have return successors, (209), 171 states have call predecessors, (209), 173 states have call successors, (209) [2022-11-02 20:20:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2334 transitions. [2022-11-02 20:20:32,762 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2334 transitions. Word has length 65 [2022-11-02 20:20:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:32,763 INFO L495 AbstractCegarLoop]: Abstraction has 1691 states and 2334 transitions. [2022-11-02 20:20:32,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-02 20:20:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2334 transitions. [2022-11-02 20:20:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:20:32,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:32,765 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:32,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:20:32,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:32,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:32,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1861088182, now seen corresponding path program 1 times [2022-11-02 20:20:32,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:32,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755665347] [2022-11-02 20:20:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:20:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:20:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755665347] [2022-11-02 20:20:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755665347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:32,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:32,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138476013] [2022-11-02 20:20:32,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:32,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:32,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:33,000 INFO L87 Difference]: Start difference. First operand 1691 states and 2334 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:20:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:34,834 INFO L93 Difference]: Finished difference Result 3219 states and 4413 transitions. [2022-11-02 20:20:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:20:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-02 20:20:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:34,845 INFO L225 Difference]: With dead ends: 3219 [2022-11-02 20:20:34,845 INFO L226 Difference]: Without dead ends: 1839 [2022-11-02 20:20:34,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:20:34,857 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 546 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2743 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:34,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2743 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:20:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2022-11-02 20:20:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1731. [2022-11-02 20:20:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1420 states have (on average 1.3915492957746478) internal successors, (1976), 1443 states have internal predecessors, (1976), 175 states have call successors, (175), 111 states have call predecessors, (175), 134 states have return successors, (217), 179 states have call predecessors, (217), 173 states have call successors, (217) [2022-11-02 20:20:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2368 transitions. [2022-11-02 20:20:35,038 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2368 transitions. Word has length 66 [2022-11-02 20:20:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:35,039 INFO L495 AbstractCegarLoop]: Abstraction has 1731 states and 2368 transitions. [2022-11-02 20:20:35,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:20:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2368 transitions. [2022-11-02 20:20:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:20:35,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:35,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:35,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:20:35,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1404519816, now seen corresponding path program 1 times [2022-11-02 20:20:35,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:35,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816160048] [2022-11-02 20:20:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:20:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:20:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:35,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816160048] [2022-11-02 20:20:35,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816160048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:35,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:35,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:20:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996120717] [2022-11-02 20:20:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:20:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:35,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:20:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:20:35,281 INFO L87 Difference]: Start difference. First operand 1731 states and 2368 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:20:38,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:38,478 INFO L93 Difference]: Finished difference Result 5303 states and 7242 transitions. [2022-11-02 20:20:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:20:38,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-11-02 20:20:38,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:38,492 INFO L225 Difference]: With dead ends: 5303 [2022-11-02 20:20:38,492 INFO L226 Difference]: Without dead ends: 2122 [2022-11-02 20:20:38,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:20:38,502 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 3425 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3443 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:38,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3443 Valid, 2856 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:20:38,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-11-02 20:20:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1942. [2022-11-02 20:20:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1942 states, 1559 states have (on average 1.3483001924310456) internal successors, (2102), 1584 states have internal predecessors, (2102), 215 states have call successors, (215), 139 states have call predecessors, (215), 166 states have return successors, (263), 221 states have call predecessors, (263), 213 states have call successors, (263) [2022-11-02 20:20:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2580 transitions. [2022-11-02 20:20:38,702 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2580 transitions. Word has length 66 [2022-11-02 20:20:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:38,703 INFO L495 AbstractCegarLoop]: Abstraction has 1942 states and 2580 transitions. [2022-11-02 20:20:38,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:20:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2580 transitions. [2022-11-02 20:20:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:20:38,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:38,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:38,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:20:38,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:38,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash -934912176, now seen corresponding path program 1 times [2022-11-02 20:20:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:38,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39724693] [2022-11-02 20:20:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:20:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:20:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:20:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:38,952 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:20:38,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:38,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39724693] [2022-11-02 20:20:38,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39724693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:38,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:38,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:38,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121036693] [2022-11-02 20:20:38,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:38,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:38,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:38,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:38,956 INFO L87 Difference]: Start difference. First operand 1942 states and 2580 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:20:40,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:40,565 INFO L93 Difference]: Finished difference Result 3767 states and 4982 transitions. [2022-11-02 20:20:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-11-02 20:20:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:40,582 INFO L225 Difference]: With dead ends: 3767 [2022-11-02 20:20:40,582 INFO L226 Difference]: Without dead ends: 2136 [2022-11-02 20:20:40,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:40,592 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 800 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:40,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2415 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:20:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2022-11-02 20:20:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2002. [2022-11-02 20:20:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 1607 states have (on average 1.3341630367143746) internal successors, (2144), 1632 states have internal predecessors, (2144), 215 states have call successors, (215), 139 states have call predecessors, (215), 178 states have return successors, (275), 233 states have call predecessors, (275), 213 states have call successors, (275) [2022-11-02 20:20:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2634 transitions. [2022-11-02 20:20:40,822 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2634 transitions. Word has length 91 [2022-11-02 20:20:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:40,822 INFO L495 AbstractCegarLoop]: Abstraction has 2002 states and 2634 transitions. [2022-11-02 20:20:40,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:20:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2634 transitions. [2022-11-02 20:20:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:20:40,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:40,826 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:40,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:20:40,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:40,827 INFO L85 PathProgramCache]: Analyzing trace with hash -491011502, now seen corresponding path program 1 times [2022-11-02 20:20:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:40,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411978681] [2022-11-02 20:20:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:40,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:40,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:20:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:20:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:20:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:20:41,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:41,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411978681] [2022-11-02 20:20:41,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411978681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:41,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:41,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:20:41,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981703269] [2022-11-02 20:20:41,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:41,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:20:41,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:41,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:20:41,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:20:41,092 INFO L87 Difference]: Start difference. First operand 2002 states and 2634 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:42,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:42,758 INFO L93 Difference]: Finished difference Result 3529 states and 4598 transitions. [2022-11-02 20:20:42,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:20:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-02 20:20:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:42,774 INFO L225 Difference]: With dead ends: 3529 [2022-11-02 20:20:42,774 INFO L226 Difference]: Without dead ends: 2076 [2022-11-02 20:20:42,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:20:42,780 INFO L413 NwaCegarLoop]: 636 mSDtfsCounter, 1237 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 2175 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:42,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 2175 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:20:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-11-02 20:20:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1781. [2022-11-02 20:20:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1439 states have (on average 1.3384294649061848) internal successors, (1926), 1459 states have internal predecessors, (1926), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-11-02 20:20:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2348 transitions. [2022-11-02 20:20:42,973 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2348 transitions. Word has length 91 [2022-11-02 20:20:42,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:42,973 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2348 transitions. [2022-11-02 20:20:42,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2348 transitions. [2022-11-02 20:20:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:20:42,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:42,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:42,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:20:42,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:42,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1448150544, now seen corresponding path program 1 times [2022-11-02 20:20:42,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:42,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496785714] [2022-11-02 20:20:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:20:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:20:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:20:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:20:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:43,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496785714] [2022-11-02 20:20:43,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496785714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:43,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:43,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:43,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27434011] [2022-11-02 20:20:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:43,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:43,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:43,158 INFO L87 Difference]: Start difference. First operand 1781 states and 2348 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:20:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:44,089 INFO L93 Difference]: Finished difference Result 4933 states and 6460 transitions. [2022-11-02 20:20:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:20:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-02 20:20:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:44,113 INFO L225 Difference]: With dead ends: 4933 [2022-11-02 20:20:44,113 INFO L226 Difference]: Without dead ends: 3464 [2022-11-02 20:20:44,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:20:44,121 INFO L413 NwaCegarLoop]: 617 mSDtfsCounter, 1155 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:44,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1809 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3464 states. [2022-11-02 20:20:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3250. [2022-11-02 20:20:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 2588 states have (on average 1.295981452859351) internal successors, (3354), 2637 states have internal predecessors, (3354), 348 states have call successors, (348), 233 states have call predecessors, (348), 312 states have return successors, (518), 382 states have call predecessors, (518), 346 states have call successors, (518) [2022-11-02 20:20:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 4220 transitions. [2022-11-02 20:20:44,447 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 4220 transitions. Word has length 91 [2022-11-02 20:20:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:44,447 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 4220 transitions. [2022-11-02 20:20:44,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:20:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 4220 transitions. [2022-11-02 20:20:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:20:44,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:44,450 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:44,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:20:44,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:44,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash 390312466, now seen corresponding path program 1 times [2022-11-02 20:20:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:44,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888251752] [2022-11-02 20:20:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:20:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:20:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:20:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:20:44,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:44,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888251752] [2022-11-02 20:20:44,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888251752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:44,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:44,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259889180] [2022-11-02 20:20:44,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:44,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:44,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:44,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:44,568 INFO L87 Difference]: Start difference. First operand 3250 states and 4220 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:45,500 INFO L93 Difference]: Finished difference Result 4834 states and 6204 transitions. [2022-11-02 20:20:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:20:45,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-02 20:20:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:45,513 INFO L225 Difference]: With dead ends: 4834 [2022-11-02 20:20:45,513 INFO L226 Difference]: Without dead ends: 1896 [2022-11-02 20:20:45,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:45,522 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 916 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:45,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1384 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:20:45,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2022-11-02 20:20:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1781. [2022-11-02 20:20:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1439 states have (on average 1.3127171646977067) internal successors, (1889), 1459 states have internal predecessors, (1889), 187 states have call successors, (187), 120 states have call predecessors, (187), 153 states have return successors, (235), 203 states have call predecessors, (235), 185 states have call successors, (235) [2022-11-02 20:20:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2311 transitions. [2022-11-02 20:20:45,719 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2311 transitions. Word has length 91 [2022-11-02 20:20:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:45,720 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2311 transitions. [2022-11-02 20:20:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:20:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2311 transitions. [2022-11-02 20:20:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:20:45,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:45,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:45,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:20:45,724 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1802771828, now seen corresponding path program 1 times [2022-11-02 20:20:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:45,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857158687] [2022-11-02 20:20:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:20:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:20:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:20:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:20:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:20:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:20:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:20:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:20:45,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:45,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857158687] [2022-11-02 20:20:45,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857158687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:45,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:45,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:20:45,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767682958] [2022-11-02 20:20:45,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:45,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:20:45,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:45,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:20:45,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:45,915 INFO L87 Difference]: Start difference. First operand 1781 states and 2311 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:20:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:48,108 INFO L93 Difference]: Finished difference Result 4122 states and 5300 transitions. [2022-11-02 20:20:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:20:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-11-02 20:20:48,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:48,123 INFO L225 Difference]: With dead ends: 4122 [2022-11-02 20:20:48,123 INFO L226 Difference]: Without dead ends: 2579 [2022-11-02 20:20:48,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:20:48,129 INFO L413 NwaCegarLoop]: 699 mSDtfsCounter, 2156 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2195 SdHoareTripleChecker+Valid, 2001 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:48,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2195 Valid, 2001 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:20:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2022-11-02 20:20:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2402. [2022-11-02 20:20:48,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 1906 states have (on average 1.2759706190975866) internal successors, (2432), 1934 states have internal predecessors, (2432), 264 states have call successors, (264), 168 states have call predecessors, (264), 230 states have return successors, (366), 301 states have call predecessors, (366), 262 states have call successors, (366) [2022-11-02 20:20:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3062 transitions. [2022-11-02 20:20:48,397 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3062 transitions. Word has length 92 [2022-11-02 20:20:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:48,399 INFO L495 AbstractCegarLoop]: Abstraction has 2402 states and 3062 transitions. [2022-11-02 20:20:48,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:20:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3062 transitions. [2022-11-02 20:20:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:20:48,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:48,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:48,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:20:48,405 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:48,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash -971775259, now seen corresponding path program 1 times [2022-11-02 20:20:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394939803] [2022-11-02 20:20:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:20:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:20:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:20:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:20:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:48,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394939803] [2022-11-02 20:20:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394939803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:48,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:48,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:20:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605239832] [2022-11-02 20:20:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:20:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:20:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:20:48,579 INFO L87 Difference]: Start difference. First operand 2402 states and 3062 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:20:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:50,740 INFO L93 Difference]: Finished difference Result 2800 states and 3700 transitions. [2022-11-02 20:20:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:20:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:20:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:50,753 INFO L225 Difference]: With dead ends: 2800 [2022-11-02 20:20:50,753 INFO L226 Difference]: Without dead ends: 2511 [2022-11-02 20:20:50,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:20:50,756 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 908 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:50,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1166 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:20:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-11-02 20:20:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2402. [2022-11-02 20:20:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2402 states, 1906 states have (on average 1.275445960125918) internal successors, (2431), 1934 states have internal predecessors, (2431), 264 states have call successors, (264), 168 states have call predecessors, (264), 230 states have return successors, (366), 301 states have call predecessors, (366), 262 states have call successors, (366) [2022-11-02 20:20:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2402 states to 2402 states and 3061 transitions. [2022-11-02 20:20:51,230 INFO L78 Accepts]: Start accepts. Automaton has 2402 states and 3061 transitions. Word has length 145 [2022-11-02 20:20:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:51,230 INFO L495 AbstractCegarLoop]: Abstraction has 2402 states and 3061 transitions. [2022-11-02 20:20:51,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:20:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2402 states and 3061 transitions. [2022-11-02 20:20:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:20:51,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:51,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:51,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:20:51,237 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:51,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:51,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1646935385, now seen corresponding path program 1 times [2022-11-02 20:20:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:51,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850197556] [2022-11-02 20:20:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:20:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:20:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:20:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:20:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:51,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:51,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850197556] [2022-11-02 20:20:51,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850197556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:51,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:51,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:20:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474113516] [2022-11-02 20:20:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:51,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:20:51,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:20:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:20:51,483 INFO L87 Difference]: Start difference. First operand 2402 states and 3061 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:20:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:55,313 INFO L93 Difference]: Finished difference Result 3202 states and 4348 transitions. [2022-11-02 20:20:55,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:20:55,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:20:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:55,327 INFO L225 Difference]: With dead ends: 3202 [2022-11-02 20:20:55,327 INFO L226 Difference]: Without dead ends: 2917 [2022-11-02 20:20:55,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:55,331 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 1446 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:55,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1624 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 20:20:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2022-11-02 20:20:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2700. [2022-11-02 20:20:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2179 states have (on average 1.3143643873336393) internal successors, (2864), 2208 states have internal predecessors, (2864), 282 states have call successors, (282), 174 states have call predecessors, (282), 237 states have return successors, (387), 319 states have call predecessors, (387), 280 states have call successors, (387) [2022-11-02 20:20:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 3533 transitions. [2022-11-02 20:20:55,911 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 3533 transitions. Word has length 145 [2022-11-02 20:20:55,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:55,911 INFO L495 AbstractCegarLoop]: Abstraction has 2700 states and 3533 transitions. [2022-11-02 20:20:55,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:20:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 3533 transitions. [2022-11-02 20:20:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:20:55,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:55,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:55,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:20:55,916 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 96068139, now seen corresponding path program 1 times [2022-11-02 20:20:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:55,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776545137] [2022-11-02 20:20:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:56,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:20:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:20:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:20:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:20:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:56,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:56,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776545137] [2022-11-02 20:20:56,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776545137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:56,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:56,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:56,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139242187] [2022-11-02 20:20:56,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:56,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:56,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:56,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:56,245 INFO L87 Difference]: Start difference. First operand 2700 states and 3533 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:00,735 INFO L93 Difference]: Finished difference Result 3920 states and 5495 transitions. [2022-11-02 20:21:00,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:00,750 INFO L225 Difference]: With dead ends: 3920 [2022-11-02 20:21:00,751 INFO L226 Difference]: Without dead ends: 3337 [2022-11-02 20:21:00,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:00,754 INFO L413 NwaCegarLoop]: 924 mSDtfsCounter, 1463 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:00,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 2652 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2659 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-02 20:21:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2022-11-02 20:21:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2977. [2022-11-02 20:21:01,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2431 states have (on average 1.3389551624845744) internal successors, (3255), 2461 states have internal predecessors, (3255), 300 states have call successors, (300), 180 states have call predecessors, (300), 244 states have return successors, (407), 338 states have call predecessors, (407), 298 states have call successors, (407) [2022-11-02 20:21:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 3962 transitions. [2022-11-02 20:21:01,295 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 3962 transitions. Word has length 145 [2022-11-02 20:21:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:01,296 INFO L495 AbstractCegarLoop]: Abstraction has 2977 states and 3962 transitions. [2022-11-02 20:21:01,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 3962 transitions. [2022-11-02 20:21:01,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:01,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:01,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:21:01,301 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:01,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1043106025, now seen corresponding path program 1 times [2022-11-02 20:21:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:01,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807083020] [2022-11-02 20:21:01,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:01,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:01,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:01,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807083020] [2022-11-02 20:21:01,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807083020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:01,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:01,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305052326] [2022-11-02 20:21:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:01,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:01,629 INFO L87 Difference]: Start difference. First operand 2977 states and 3962 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:06,138 INFO L93 Difference]: Finished difference Result 4978 states and 7172 transitions. [2022-11-02 20:21:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:06,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:06,158 INFO L225 Difference]: With dead ends: 4978 [2022-11-02 20:21:06,158 INFO L226 Difference]: Without dead ends: 4118 [2022-11-02 20:21:06,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:06,163 INFO L413 NwaCegarLoop]: 916 mSDtfsCounter, 1460 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:06,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1488 Valid, 2644 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-02 20:21:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2022-11-02 20:21:06,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3532. [2022-11-02 20:21:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2936 states have (on average 1.375340599455041) internal successors, (4038), 2968 states have internal predecessors, (4038), 336 states have call successors, (336), 192 states have call predecessors, (336), 258 states have return successors, (451), 376 states have call predecessors, (451), 334 states have call successors, (451) [2022-11-02 20:21:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4825 transitions. [2022-11-02 20:21:06,677 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4825 transitions. Word has length 145 [2022-11-02 20:21:06,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:06,677 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4825 transitions. [2022-11-02 20:21:06,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4825 transitions. [2022-11-02 20:21:06,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:06,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:06,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:06,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:21:06,682 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1904939627, now seen corresponding path program 1 times [2022-11-02 20:21:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:06,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842230012] [2022-11-02 20:21:06,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:06,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842230012] [2022-11-02 20:21:06,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842230012] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:06,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:06,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230029319] [2022-11-02 20:21:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:06,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:06,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:06,958 INFO L87 Difference]: Start difference. First operand 3532 states and 4825 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:11,621 INFO L93 Difference]: Finished difference Result 7013 states and 10379 transitions. [2022-11-02 20:21:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:11,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:11,650 INFO L225 Difference]: With dead ends: 7013 [2022-11-02 20:21:11,650 INFO L226 Difference]: Without dead ends: 5598 [2022-11-02 20:21:11,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:11,657 INFO L413 NwaCegarLoop]: 912 mSDtfsCounter, 1456 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:11,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 2640 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:21:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-11-02 20:21:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 4643. [2022-11-02 20:21:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4643 states, 3947 states have (on average 1.4198125158348112) internal successors, (5604), 3983 states have internal predecessors, (5604), 408 states have call successors, (408), 216 states have call predecessors, (408), 286 states have return successors, (545), 452 states have call predecessors, (545), 406 states have call successors, (545) [2022-11-02 20:21:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4643 states to 4643 states and 6557 transitions. [2022-11-02 20:21:12,271 INFO L78 Accepts]: Start accepts. Automaton has 4643 states and 6557 transitions. Word has length 145 [2022-11-02 20:21:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:12,271 INFO L495 AbstractCegarLoop]: Abstraction has 4643 states and 6557 transitions. [2022-11-02 20:21:12,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4643 states and 6557 transitions. [2022-11-02 20:21:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:12,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:12,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:12,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:21:12,276 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash -145469271, now seen corresponding path program 1 times [2022-11-02 20:21:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:12,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933958970] [2022-11-02 20:21:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:12,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933958970] [2022-11-02 20:21:12,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933958970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:12,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:12,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497867610] [2022-11-02 20:21:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:12,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:12,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:12,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:12,494 INFO L87 Difference]: Start difference. First operand 4643 states and 6557 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:17,059 INFO L93 Difference]: Finished difference Result 11082 states and 16809 transitions. [2022-11-02 20:21:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:17,087 INFO L225 Difference]: With dead ends: 11082 [2022-11-02 20:21:17,088 INFO L226 Difference]: Without dead ends: 8556 [2022-11-02 20:21:17,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:17,099 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 1452 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:17,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2636 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 20:21:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8556 states. [2022-11-02 20:21:17,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8556 to 6870. [2022-11-02 20:21:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 5974 states have (on average 1.4633411449615) internal successors, (8742), 6018 states have internal predecessors, (8742), 552 states have call successors, (552), 264 states have call predecessors, (552), 342 states have return successors, (751), 604 states have call predecessors, (751), 550 states have call successors, (751) [2022-11-02 20:21:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10045 transitions. [2022-11-02 20:21:17,854 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10045 transitions. Word has length 145 [2022-11-02 20:21:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:17,854 INFO L495 AbstractCegarLoop]: Abstraction has 6870 states and 10045 transitions. [2022-11-02 20:21:17,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10045 transitions. [2022-11-02 20:21:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:17,859 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:17,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:17,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:21:17,860 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:17,861 INFO L85 PathProgramCache]: Analyzing trace with hash 342577835, now seen corresponding path program 1 times [2022-11-02 20:21:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419436376] [2022-11-02 20:21:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:18,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:18,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419436376] [2022-11-02 20:21:18,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419436376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:18,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:18,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:18,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384643077] [2022-11-02 20:21:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:18,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:18,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:18,063 INFO L87 Difference]: Start difference. First operand 6870 states and 10045 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:21,174 INFO L93 Difference]: Finished difference Result 13387 states and 20520 transitions. [2022-11-02 20:21:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:21,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:21,204 INFO L225 Difference]: With dead ends: 13387 [2022-11-02 20:21:21,204 INFO L226 Difference]: Without dead ends: 8634 [2022-11-02 20:21:21,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:21,220 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 1298 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:21,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1327 Valid, 1390 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:21:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states. [2022-11-02 20:21:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 6870. [2022-11-02 20:21:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 5974 states have (on average 1.4604954804151322) internal successors, (8725), 6018 states have internal predecessors, (8725), 552 states have call successors, (552), 264 states have call predecessors, (552), 342 states have return successors, (751), 604 states have call predecessors, (751), 550 states have call successors, (751) [2022-11-02 20:21:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10028 transitions. [2022-11-02 20:21:22,034 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10028 transitions. Word has length 145 [2022-11-02 20:21:22,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:22,034 INFO L495 AbstractCegarLoop]: Abstraction has 6870 states and 10028 transitions. [2022-11-02 20:21:22,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10028 transitions. [2022-11-02 20:21:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:22,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:22,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:22,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:21:22,040 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash -750057367, now seen corresponding path program 1 times [2022-11-02 20:21:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:22,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524460734] [2022-11-02 20:21:22,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:22,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:22,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524460734] [2022-11-02 20:21:22,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524460734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:22,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:22,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:22,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139433756] [2022-11-02 20:21:22,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:22,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:22,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:22,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:22,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:22,282 INFO L87 Difference]: Start difference. First operand 6870 states and 10028 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:25,260 INFO L93 Difference]: Finished difference Result 13369 states and 20434 transitions. [2022-11-02 20:21:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:25,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:25,289 INFO L225 Difference]: With dead ends: 13369 [2022-11-02 20:21:25,290 INFO L226 Difference]: Without dead ends: 8616 [2022-11-02 20:21:25,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:25,303 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 1167 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:25,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 1571 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:21:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8616 states. [2022-11-02 20:21:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8616 to 6870. [2022-11-02 20:21:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6870 states, 5974 states have (on average 1.4576498158687647) internal successors, (8708), 6018 states have internal predecessors, (8708), 552 states have call successors, (552), 264 states have call predecessors, (552), 342 states have return successors, (751), 604 states have call predecessors, (751), 550 states have call successors, (751) [2022-11-02 20:21:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6870 states to 6870 states and 10011 transitions. [2022-11-02 20:21:26,314 INFO L78 Accepts]: Start accepts. Automaton has 6870 states and 10011 transitions. Word has length 145 [2022-11-02 20:21:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:26,314 INFO L495 AbstractCegarLoop]: Abstraction has 6870 states and 10011 transitions. [2022-11-02 20:21:26,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:26,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6870 states and 10011 transitions. [2022-11-02 20:21:26,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:26,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:26,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:26,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:21:26,320 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:26,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:26,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2032229653, now seen corresponding path program 1 times [2022-11-02 20:21:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:26,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697108513] [2022-11-02 20:21:26,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:26,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:26,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:26,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:26,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:26,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:26,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:26,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697108513] [2022-11-02 20:21:26,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697108513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:26,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:26,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:26,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837242647] [2022-11-02 20:21:26,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:26,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:26,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:26,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:26,538 INFO L87 Difference]: Start difference. First operand 6870 states and 10011 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:31,757 INFO L93 Difference]: Finished difference Result 19164 states and 29455 transitions. [2022-11-02 20:21:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:21:31,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:31,803 INFO L225 Difference]: With dead ends: 19164 [2022-11-02 20:21:31,803 INFO L226 Difference]: Without dead ends: 14411 [2022-11-02 20:21:31,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:21:31,820 INFO L413 NwaCegarLoop]: 886 mSDtfsCounter, 1434 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:31,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 2614 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 20:21:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14411 states. [2022-11-02 20:21:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14411 to 11386. [2022-11-02 20:21:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 10090 states have (on average 1.490386521308226) internal successors, (15038), 10150 states have internal predecessors, (15038), 840 states have call successors, (840), 360 states have call predecessors, (840), 454 states have return successors, (1217), 908 states have call predecessors, (1217), 838 states have call successors, (1217) [2022-11-02 20:21:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 17095 transitions. [2022-11-02 20:21:33,711 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 17095 transitions. Word has length 145 [2022-11-02 20:21:33,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:33,712 INFO L495 AbstractCegarLoop]: Abstraction has 11386 states and 17095 transitions. [2022-11-02 20:21:33,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 17095 transitions. [2022-11-02 20:21:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:33,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:33,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:33,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:21:33,721 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:33,721 INFO L85 PathProgramCache]: Analyzing trace with hash 540734957, now seen corresponding path program 1 times [2022-11-02 20:21:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:33,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105633809] [2022-11-02 20:21:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:33,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105633809] [2022-11-02 20:21:33,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105633809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:33,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:33,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641161741] [2022-11-02 20:21:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:33,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:33,937 INFO L87 Difference]: Start difference. First operand 11386 states and 17095 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:37,428 INFO L93 Difference]: Finished difference Result 23819 states and 37022 transitions. [2022-11-02 20:21:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:37,478 INFO L225 Difference]: With dead ends: 23819 [2022-11-02 20:21:37,478 INFO L226 Difference]: Without dead ends: 14550 [2022-11-02 20:21:37,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:21:37,500 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 1296 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:37,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1375 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:21:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14550 states. [2022-11-02 20:21:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14550 to 11386. [2022-11-02 20:21:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11386 states, 10090 states have (on average 1.4871159563924679) internal successors, (15005), 10150 states have internal predecessors, (15005), 840 states have call successors, (840), 360 states have call predecessors, (840), 454 states have return successors, (1217), 908 states have call predecessors, (1217), 838 states have call successors, (1217) [2022-11-02 20:21:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11386 states to 11386 states and 17062 transitions. [2022-11-02 20:21:39,295 INFO L78 Accepts]: Start accepts. Automaton has 11386 states and 17062 transitions. Word has length 145 [2022-11-02 20:21:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:39,295 INFO L495 AbstractCegarLoop]: Abstraction has 11386 states and 17062 transitions. [2022-11-02 20:21:39,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 11386 states and 17062 transitions. [2022-11-02 20:21:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:39,305 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:39,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:39,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:21:39,305 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:39,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash 208091819, now seen corresponding path program 1 times [2022-11-02 20:21:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:39,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747566624] [2022-11-02 20:21:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:39,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:39,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747566624] [2022-11-02 20:21:39,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747566624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:39,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:39,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847052667] [2022-11-02 20:21:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:39,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:39,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:39,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:39,563 INFO L87 Difference]: Start difference. First operand 11386 states and 17062 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:48,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:48,152 INFO L93 Difference]: Finished difference Result 39724 states and 61659 transitions. [2022-11-02 20:21:48,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:21:48,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:21:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:48,257 INFO L225 Difference]: With dead ends: 39724 [2022-11-02 20:21:48,258 INFO L226 Difference]: Without dead ends: 30455 [2022-11-02 20:21:48,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:21:48,287 INFO L413 NwaCegarLoop]: 1025 mSDtfsCounter, 1519 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:48,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 2745 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 20:21:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30455 states. [2022-11-02 20:21:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30455 to 20380. [2022-11-02 20:21:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20380 states, 18316 states have (on average 1.5088993229962875) internal successors, (27637), 18408 states have internal predecessors, (27637), 1384 states have call successors, (1384), 552 states have call predecessors, (1384), 678 states have return successors, (2279), 1484 states have call predecessors, (2279), 1382 states have call successors, (2279) [2022-11-02 20:21:51,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20380 states to 20380 states and 31300 transitions. [2022-11-02 20:21:51,450 INFO L78 Accepts]: Start accepts. Automaton has 20380 states and 31300 transitions. Word has length 145 [2022-11-02 20:21:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:51,450 INFO L495 AbstractCegarLoop]: Abstraction has 20380 states and 31300 transitions. [2022-11-02 20:21:51,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:21:51,450 INFO L276 IsEmpty]: Start isEmpty. Operand 20380 states and 31300 transitions. [2022-11-02 20:21:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:21:51,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:51,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:51,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:21:51,462 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:21:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2137024045, now seen corresponding path program 1 times [2022-11-02 20:21:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:51,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081955373] [2022-11-02 20:21:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:21:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:21:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:21:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:21:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:21:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:51,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:51,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081955373] [2022-11-02 20:21:51,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081955373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:51,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:51,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:21:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052742771] [2022-11-02 20:21:51,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:21:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:21:51,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:21:51,679 INFO L87 Difference]: Start difference. First operand 20380 states and 31300 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:05,596 INFO L93 Difference]: Finished difference Result 75532 states and 118735 transitions. [2022-11-02 20:22:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:22:05,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2022-11-02 20:22:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:05,770 INFO L225 Difference]: With dead ends: 75532 [2022-11-02 20:22:05,771 INFO L226 Difference]: Without dead ends: 57269 [2022-11-02 20:22:05,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:22:05,826 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 1754 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:05,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 2584 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 20:22:05,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57269 states. [2022-11-02 20:22:12,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57269 to 38013. [2022-11-02 20:22:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38013 states, 34445 states have (on average 1.5217012628828568) internal successors, (52415), 34601 states have internal predecessors, (52415), 2440 states have call successors, (2440), 936 states have call predecessors, (2440), 1126 states have return successors, (4857), 2604 states have call predecessors, (4857), 2438 states have call successors, (4857) [2022-11-02 20:22:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38013 states to 38013 states and 59712 transitions. [2022-11-02 20:22:12,278 INFO L78 Accepts]: Start accepts. Automaton has 38013 states and 59712 transitions. Word has length 145 [2022-11-02 20:22:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:12,279 INFO L495 AbstractCegarLoop]: Abstraction has 38013 states and 59712 transitions. [2022-11-02 20:22:12,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:22:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38013 states and 59712 transitions. [2022-11-02 20:22:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 20:22:12,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:12,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:12,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:22:12,299 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:22:12,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:12,299 INFO L85 PathProgramCache]: Analyzing trace with hash -156056981, now seen corresponding path program 1 times [2022-11-02 20:22:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:12,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10991802] [2022-11-02 20:22:12,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:12,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:22:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-02 20:22:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 20:22:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:22:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 20:22:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:12,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10991802] [2022-11-02 20:22:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10991802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:22:12,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:22:12,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:22:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045148749] [2022-11-02 20:22:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:22:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:22:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:22:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:22:12,604 INFO L87 Difference]: Start difference. First operand 38013 states and 59712 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)