./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/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 57a0d461468e871620bb6a0a3de7e8bdfa4741915d12326365887ea97e191d16 --- 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:17:42,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:17:42,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:17:42,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:17:42,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:17:42,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:17:42,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:17:42,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:17:42,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:17:42,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:17:42,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:17:42,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:17:42,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:17:42,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:17:42,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:17:42,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:17:42,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:17:42,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:17:42,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:17:42,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:17:42,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:17:42,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:17:42,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:17:42,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:17:42,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:17:42,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:17:42,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:17:42,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:17:42,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:17:42,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:17:42,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:17:42,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:17:42,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:17:42,784 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:17:42,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:17:42,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:17:42,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:17:42,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:17:42,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:17:42,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:17:42,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:17:42,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:17:42,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:17:42,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:17:42,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:17:42,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:17:42,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:17:42,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:17:42,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:17:42,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:17:42,848 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:17:42,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:17:42,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:17:42,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:17:42,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:17:42,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:17:42,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:17:42,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:17:42,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:17:42,852 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:17:42,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:17:42,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:17:42,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:17:42,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:17:42,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:17:42,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:17:42,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:42,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:17:42,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:17:42,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:17:42,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:17:42,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:17:42,855 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:17:42,856 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:17:42,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:17:42,856 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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/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 -> 57a0d461468e871620bb6a0a3de7e8bdfa4741915d12326365887ea97e191d16 [2022-11-02 20:17:43,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:17:43,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:17:43,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:17:43,186 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:17:43,193 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:17:43,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c [2022-11-02 20:17:43,288 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/data/efe65905e/57cbac7e862a433084e955d4922d992d/FLAG633d1c3ab [2022-11-02 20:17:43,980 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:17:43,980 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c [2022-11-02 20:17:44,000 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/data/efe65905e/57cbac7e862a433084e955d4922d992d/FLAG633d1c3ab [2022-11-02 20:17:44,275 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/data/efe65905e/57cbac7e862a433084e955d4922d992d [2022-11-02 20:17:44,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:17:44,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:17:44,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:17:44,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:17:44,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:17:44,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:44,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa48fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44, skipping insertion in model container [2022-11-02 20:17:44,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:44,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:17:44,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:17:44,620 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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[911,924] [2022-11-02 20:17:44,695 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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[8416,8429] [2022-11-02 20:17:44,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:17:44,835 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:17:44,849 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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[911,924] [2022-11-02 20:17:44,874 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_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.12.cil-2.c[8416,8429] [2022-11-02 20:17:44,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:17:44,976 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:17:44,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44 WrapperNode [2022-11-02 20:17:44,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:17:44,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:44,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:17:44,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:17:44,988 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:17:44" (1/1) ... [2022-11-02 20:17:45,018 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:17:44" (1/1) ... [2022-11-02 20:17:45,082 INFO L138 Inliner]: procedures = 79, calls = 97, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1078 [2022-11-02 20:17:45,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:45,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:17:45,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:17:45,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:17:45,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,141 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:17:45,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:17:45,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:17:45,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:17:45,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (1/1) ... [2022-11-02 20:17:45,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:45,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:45,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:17:45,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:17:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:17:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:17:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:17:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 20:17:45,245 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 20:17:45,245 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-02 20:17:45,246 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-02 20:17:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-02 20:17:45,246 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-02 20:17:45,246 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-02 20:17:45,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-02 20:17:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-02 20:17:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-02 20:17:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-02 20:17:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-02 20:17:45,247 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-02 20:17:45,247 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-02 20:17:45,248 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 20:17:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 20:17:45,248 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-02 20:17:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-02 20:17:45,248 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-02 20:17:45,248 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-02 20:17:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:17:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-02 20:17:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-02 20:17:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-02 20:17:45,249 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-02 20:17:45,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:17:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:17:45,250 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-02 20:17:45,250 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-02 20:17:45,412 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:17:45,415 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:17:46,790 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-02 20:17:46,790 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:17:46,900 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:17:46,922 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:17:46,922 INFO L300 CfgBuilder]: Removed 19 assume(true) statements. [2022-11-02 20:17:46,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:46 BoogieIcfgContainer [2022-11-02 20:17:46,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:17:46,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:17:46,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:17:46,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:17:46,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:17:44" (1/3) ... [2022-11-02 20:17:46,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348f7cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:46, skipping insertion in model container [2022-11-02 20:17:46,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:44" (2/3) ... [2022-11-02 20:17:46,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348f7cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:46, skipping insertion in model container [2022-11-02 20:17:46,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:46" (3/3) ... [2022-11-02 20:17:46,939 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.12.cil-2.c [2022-11-02 20:17:46,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:17:46,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:17:47,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:17:47,085 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;@22f62b89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:17:47,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:17:47,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 440 states have (on average 1.6386363636363637) internal successors, (721), 446 states have internal predecessors, (721), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2022-11-02 20:17:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:17:47,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:47,127 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:17:47,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -50409674, now seen corresponding path program 1 times [2022-11-02 20:17:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:47,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297833398] [2022-11-02 20:17:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:17:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:17:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:17:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:17:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:17:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:17:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,845 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:17:47,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:47,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297833398] [2022-11-02 20:17:47,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297833398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:47,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:47,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193544282] [2022-11-02 20:17:47,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:47,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:47,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:47,911 INFO L87 Difference]: Start difference. First operand has 499 states, 440 states have (on average 1.6386363636363637) internal successors, (721), 446 states have internal predecessors, (721), 42 states have call successors, (42), 14 states have call predecessors, (42), 14 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) 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:17:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:49,335 INFO L93 Difference]: Finished difference Result 988 states and 1590 transitions. [2022-11-02 20:17:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:17:49,338 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:17:49,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:49,364 INFO L225 Difference]: With dead ends: 988 [2022-11-02 20:17:49,364 INFO L226 Difference]: Without dead ends: 507 [2022-11-02 20:17:49,379 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:17:49,387 INFO L413 NwaCegarLoop]: 760 mSDtfsCounter, 1105 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1751 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:49,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1751 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:17:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-11-02 20:17:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 489. [2022-11-02 20:17:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 432 states have (on average 1.5509259259259258) internal successors, (670), 436 states have internal predecessors, (670), 42 states have call successors, (42), 14 states have call predecessors, (42), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-11-02 20:17:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 752 transitions. [2022-11-02 20:17:49,537 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 752 transitions. Word has length 65 [2022-11-02 20:17:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:49,538 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 752 transitions. [2022-11-02 20:17:49,538 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:17:49,539 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 752 transitions. [2022-11-02 20:17:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:17:49,543 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:49,543 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:17:49,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:17:49,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1437195084, now seen corresponding path program 1 times [2022-11-02 20:17:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191998859] [2022-11-02 20:17:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:49,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:17:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:17:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:17:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:17:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:17:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:17:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,792 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:17:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:49,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191998859] [2022-11-02 20:17:49,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191998859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:49,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:49,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:17:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020403325] [2022-11-02 20:17:49,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:49,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:17:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:17:49,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:17:49,802 INFO L87 Difference]: Start difference. First operand 489 states and 752 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:17:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:51,500 INFO L93 Difference]: Finished difference Result 744 states and 1121 transitions. [2022-11-02 20:17:51,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:17:51,501 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:17:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:51,507 INFO L225 Difference]: With dead ends: 744 [2022-11-02 20:17:51,507 INFO L226 Difference]: Without dead ends: 640 [2022-11-02 20:17:51,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:17:51,527 INFO L413 NwaCegarLoop]: 758 mSDtfsCounter, 903 mSDsluCounter, 2077 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2835 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:51,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2835 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:17:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-11-02 20:17:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 601. [2022-11-02 20:17:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 522 states have (on average 1.524904214559387) internal successors, (796), 528 states have internal predecessors, (796), 55 states have call successors, (55), 21 states have call predecessors, (55), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2022-11-02 20:17:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 909 transitions. [2022-11-02 20:17:51,582 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 909 transitions. Word has length 65 [2022-11-02 20:17:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:51,583 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 909 transitions. [2022-11-02 20:17:51,583 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:17:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 909 transitions. [2022-11-02 20:17:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:17:51,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:51,586 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:17:51,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:17:51,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:51,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash 241693556, now seen corresponding path program 1 times [2022-11-02 20:17:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:51,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636352655] [2022-11-02 20:17:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:51,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:17:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:17:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:17:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:17:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:17:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:17:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,827 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:17:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:51,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636352655] [2022-11-02 20:17:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636352655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:51,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:17:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927456065] [2022-11-02 20:17:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:51,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:17:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:17:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:17:51,832 INFO L87 Difference]: Start difference. First operand 601 states and 909 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:17:53,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:53,717 INFO L93 Difference]: Finished difference Result 998 states and 1474 transitions. [2022-11-02 20:17:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:17:53,717 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:17:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:53,723 INFO L225 Difference]: With dead ends: 998 [2022-11-02 20:17:53,724 INFO L226 Difference]: Without dead ends: 789 [2022-11-02 20:17:53,725 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:17:53,727 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 1456 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:53,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 2896 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:17:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-02 20:17:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 713. [2022-11-02 20:17:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 612 states have (on average 1.5049019607843137) internal successors, (921), 620 states have internal predecessors, (921), 68 states have call successors, (68), 28 states have call predecessors, (68), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2022-11-02 20:17:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1068 transitions. [2022-11-02 20:17:53,807 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1068 transitions. Word has length 65 [2022-11-02 20:17:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:53,808 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1068 transitions. [2022-11-02 20:17:53,808 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:17:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1068 transitions. [2022-11-02 20:17:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:17:53,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:53,839 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:17:53,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:17:53,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1786892554, now seen corresponding path program 1 times [2022-11-02 20:17:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:53,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568567723] [2022-11-02 20:17:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:53,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:17:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:17:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:17:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:17:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:17:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:17:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,089 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:17:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:54,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568567723] [2022-11-02 20:17:54,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568567723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:54,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:54,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:17:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678692930] [2022-11-02 20:17:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:54,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:17:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:17:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:17:54,092 INFO L87 Difference]: Start difference. First operand 713 states and 1068 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:17:57,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:57,421 INFO L93 Difference]: Finished difference Result 2259 states and 3265 transitions. [2022-11-02 20:17:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:17:57,422 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:17:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:57,433 INFO L225 Difference]: With dead ends: 2259 [2022-11-02 20:17:57,433 INFO L226 Difference]: Without dead ends: 1926 [2022-11-02 20:17:57,436 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:17:57,437 INFO L413 NwaCegarLoop]: 882 mSDtfsCounter, 3850 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3868 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:57,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3868 Valid, 3237 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 1920 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-02 20:17:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-11-02 20:17:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1766. [2022-11-02 20:17:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1460 states have (on average 1.4157534246575343) internal successors, (2067), 1483 states have internal predecessors, (2067), 178 states have call successors, (178), 111 states have call predecessors, (178), 126 states have return successors, (212), 174 states have call predecessors, (212), 176 states have call successors, (212) [2022-11-02 20:17:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2457 transitions. [2022-11-02 20:17:57,613 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2457 transitions. Word has length 65 [2022-11-02 20:17:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:57,614 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 2457 transitions. [2022-11-02 20:17:57,614 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:17:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2457 transitions. [2022-11-02 20:17:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:17:57,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:57,616 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:17:57,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:17:57,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -666149630, now seen corresponding path program 1 times [2022-11-02 20:17:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83332221] [2022-11-02 20:17:57,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:17:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:17:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:17:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:17:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:17:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:17:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:17:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:57,817 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:17:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:57,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83332221] [2022-11-02 20:17:57,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83332221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:57,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:57,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:17:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766918832] [2022-11-02 20:17:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:17:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:57,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:17:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:17:57,821 INFO L87 Difference]: Start difference. First operand 1766 states and 2457 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:17:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:59,824 INFO L93 Difference]: Finished difference Result 3294 states and 4536 transitions. [2022-11-02 20:17:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:17:59,825 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:17:59,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:59,838 INFO L225 Difference]: With dead ends: 3294 [2022-11-02 20:17:59,839 INFO L226 Difference]: Without dead ends: 1914 [2022-11-02 20:17:59,846 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:17:59,850 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 992 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:59,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 2938 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:17:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2022-11-02 20:18:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1806. [2022-11-02 20:18:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1492 states have (on average 1.4028150134048258) internal successors, (2093), 1515 states have internal predecessors, (2093), 178 states have call successors, (178), 111 states have call predecessors, (178), 134 states have return successors, (220), 182 states have call predecessors, (220), 176 states have call successors, (220) [2022-11-02 20:18:00,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2491 transitions. [2022-11-02 20:18:00,038 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2491 transitions. Word has length 66 [2022-11-02 20:18:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:00,039 INFO L495 AbstractCegarLoop]: Abstraction has 1806 states and 2491 transitions. [2022-11-02 20:18:00,039 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:18:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2491 transitions. [2022-11-02 20:18:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:18:00,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:00,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:18:00,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:18:00,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1695508928, now seen corresponding path program 1 times [2022-11-02 20:18:00,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:00,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903229194] [2022-11-02 20:18:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:18:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:18:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:18:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:18:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:18:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:00,308 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:18:00,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:00,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903229194] [2022-11-02 20:18:00,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903229194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:00,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:00,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:18:00,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289951432] [2022-11-02 20:18:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:00,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:18:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:00,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:18:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:18:00,315 INFO L87 Difference]: Start difference. First operand 1806 states and 2491 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:18:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:03,578 INFO L93 Difference]: Finished difference Result 5378 states and 7365 transitions. [2022-11-02 20:18:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:18:03,579 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:18:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:03,590 INFO L225 Difference]: With dead ends: 5378 [2022-11-02 20:18:03,591 INFO L226 Difference]: Without dead ends: 2197 [2022-11-02 20:18:03,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:18:03,605 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 3913 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3931 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 2539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:03,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3931 Valid, 3280 Invalid, 2539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:18:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2022-11-02 20:18:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 2017. [2022-11-02 20:18:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1631 states have (on average 1.3605150214592274) internal successors, (2219), 1656 states have internal predecessors, (2219), 218 states have call successors, (218), 139 states have call predecessors, (218), 166 states have return successors, (266), 224 states have call predecessors, (266), 216 states have call successors, (266) [2022-11-02 20:18:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2703 transitions. [2022-11-02 20:18:03,824 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2703 transitions. Word has length 66 [2022-11-02 20:18:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:03,825 INFO L495 AbstractCegarLoop]: Abstraction has 2017 states and 2703 transitions. [2022-11-02 20:18:03,825 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:18:03,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2703 transitions. [2022-11-02 20:18:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:18:03,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:03,835 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:18:03,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:18:03,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:03,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2019341431, now seen corresponding path program 1 times [2022-11-02 20:18:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:03,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545501640] [2022-11-02 20:18:03,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:18:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:03,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:18:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:18:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:18:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:18:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:18:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,065 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:18:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:04,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545501640] [2022-11-02 20:18:04,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545501640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:04,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:04,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:18:04,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886538416] [2022-11-02 20:18:04,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:04,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:18:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:04,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:18:04,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:04,070 INFO L87 Difference]: Start difference. First operand 2017 states and 2703 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:18:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:06,036 INFO L93 Difference]: Finished difference Result 3842 states and 5105 transitions. [2022-11-02 20:18:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:18:06,037 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:18:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:06,050 INFO L225 Difference]: With dead ends: 3842 [2022-11-02 20:18:06,051 INFO L226 Difference]: Without dead ends: 2211 [2022-11-02 20:18:06,055 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:18:06,063 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 986 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:06,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 2891 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:18:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2022-11-02 20:18:06,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2077. [2022-11-02 20:18:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2077 states, 1679 states have (on average 1.3466349017272186) internal successors, (2261), 1704 states have internal predecessors, (2261), 218 states have call successors, (218), 139 states have call predecessors, (218), 178 states have return successors, (278), 236 states have call predecessors, (278), 216 states have call successors, (278) [2022-11-02 20:18:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 2757 transitions. [2022-11-02 20:18:06,276 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 2757 transitions. Word has length 91 [2022-11-02 20:18:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:06,277 INFO L495 AbstractCegarLoop]: Abstraction has 2077 states and 2757 transitions. [2022-11-02 20:18:06,277 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:18:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2757 transitions. [2022-11-02 20:18:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:18:06,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:06,279 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:18:06,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:18:06,280 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:06,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1575440757, now seen corresponding path program 1 times [2022-11-02 20:18:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:06,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16700025] [2022-11-02 20:18:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:18:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:18:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:18:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:18:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:18:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:18:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:06,504 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:18:06,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:06,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16700025] [2022-11-02 20:18:06,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16700025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:06,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:06,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:18:06,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470792101] [2022-11-02 20:18:06,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:06,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:18:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:06,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:18:06,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:18:06,508 INFO L87 Difference]: Start difference. First operand 2077 states and 2757 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:18:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:08,271 INFO L93 Difference]: Finished difference Result 3604 states and 4721 transitions. [2022-11-02 20:18:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:18:08,273 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:18:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:08,293 INFO L225 Difference]: With dead ends: 3604 [2022-11-02 20:18:08,293 INFO L226 Difference]: Without dead ends: 2151 [2022-11-02 20:18:08,297 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:18:08,298 INFO L413 NwaCegarLoop]: 758 mSDtfsCounter, 1471 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:08,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 2582 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:18:08,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2022-11-02 20:18:08,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1856. [2022-11-02 20:18:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1511 states have (on average 1.3520847121111847) internal successors, (2043), 1531 states have internal predecessors, (2043), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-11-02 20:18:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2471 transitions. [2022-11-02 20:18:08,492 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2471 transitions. Word has length 91 [2022-11-02 20:18:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:08,493 INFO L495 AbstractCegarLoop]: Abstraction has 1856 states and 2471 transitions. [2022-11-02 20:18:08,493 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:18:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2471 transitions. [2022-11-02 20:18:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:18:08,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:08,495 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:18:08,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:18:08,496 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 363721289, now seen corresponding path program 1 times [2022-11-02 20:18:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:08,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281558023] [2022-11-02 20:18:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:08,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:18:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:18:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:18:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:18:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:18:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:18:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:08,656 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:18:08,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:08,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281558023] [2022-11-02 20:18:08,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281558023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:08,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:08,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:08,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807109989] [2022-11-02 20:18:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:08,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:08,660 INFO L87 Difference]: Start difference. First operand 1856 states and 2471 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:18:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:09,227 INFO L93 Difference]: Finished difference Result 3432 states and 4527 transitions. [2022-11-02 20:18:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:18:09,228 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:18:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:09,239 INFO L225 Difference]: With dead ends: 3432 [2022-11-02 20:18:09,240 INFO L226 Difference]: Without dead ends: 1963 [2022-11-02 20:18:09,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:18:09,247 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 1324 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1358 SdHoareTripleChecker+Valid, 2020 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:09,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1358 Valid, 2020 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:18:09,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-11-02 20:18:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1856. [2022-11-02 20:18:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1511 states have (on average 1.328259430840503) internal successors, (2007), 1531 states have internal predecessors, (2007), 190 states have call successors, (190), 120 states have call predecessors, (190), 153 states have return successors, (238), 206 states have call predecessors, (238), 188 states have call successors, (238) [2022-11-02 20:18:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2435 transitions. [2022-11-02 20:18:09,471 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2435 transitions. Word has length 91 [2022-11-02 20:18:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:09,471 INFO L495 AbstractCegarLoop]: Abstraction has 1856 states and 2435 transitions. [2022-11-02 20:18:09,472 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:18:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2435 transitions. [2022-11-02 20:18:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:18:09,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:09,474 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:18:09,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:18:09,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash -128979882, now seen corresponding path program 1 times [2022-11-02 20:18:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:09,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459955098] [2022-11-02 20:18:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:18:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:18:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:18:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:18:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:18:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:18:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:09,680 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:18:09,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:09,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459955098] [2022-11-02 20:18:09,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459955098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:09,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:09,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:18:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540825378] [2022-11-02 20:18:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:18:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:18:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:09,683 INFO L87 Difference]: Start difference. First operand 1856 states and 2435 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:18:12,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:12,021 INFO L93 Difference]: Finished difference Result 4274 states and 5518 transitions. [2022-11-02 20:18:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:18:12,022 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:18:12,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:12,039 INFO L225 Difference]: With dead ends: 4274 [2022-11-02 20:18:12,041 INFO L226 Difference]: Without dead ends: 2654 [2022-11-02 20:18:12,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:18:12,047 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 2954 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:12,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 2305 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:18:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2022-11-02 20:18:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2477. [2022-11-02 20:18:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 1978 states have (on average 1.288675429726997) internal successors, (2549), 2006 states have internal predecessors, (2549), 267 states have call successors, (267), 168 states have call predecessors, (267), 230 states have return successors, (369), 304 states have call predecessors, (369), 265 states have call successors, (369) [2022-11-02 20:18:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3185 transitions. [2022-11-02 20:18:12,308 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3185 transitions. Word has length 92 [2022-11-02 20:18:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:12,310 INFO L495 AbstractCegarLoop]: Abstraction has 2477 states and 3185 transitions. [2022-11-02 20:18:12,310 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:18:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3185 transitions. [2022-11-02 20:18:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 20:18:12,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:12,315 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:18:12,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1304859459, now seen corresponding path program 1 times [2022-11-02 20:18:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:12,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182924957] [2022-11-02 20:18:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:12,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:18:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:18:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:18:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:18:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:18:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:18:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:18:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:18:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:18:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:18:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:18:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:18:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:18:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:18:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:18:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 20:18:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:12,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182924957] [2022-11-02 20:18:12,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182924957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:18:12,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458192762] [2022-11-02 20:18:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:12,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:18:12,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:18:12,590 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:18:12,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:18:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:12,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:18:12,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:18:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:18:13,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:18:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458192762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:13,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:18:13,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:18:13,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088310471] [2022-11-02 20:18:13,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:18:13,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:18:13,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:18:13,069 INFO L87 Difference]: Start difference. First operand 2477 states and 3185 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:18:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:13,522 INFO L93 Difference]: Finished difference Result 6403 states and 8014 transitions. [2022-11-02 20:18:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:18:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-11-02 20:18:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:13,544 INFO L225 Difference]: With dead ends: 6403 [2022-11-02 20:18:13,544 INFO L226 Difference]: Without dead ends: 4389 [2022-11-02 20:18:13,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:18:13,552 INFO L413 NwaCegarLoop]: 792 mSDtfsCounter, 61 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:13,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1511 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:18:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2022-11-02 20:18:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 4347. [2022-11-02 20:18:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 3435 states have (on average 1.252692867540029) internal successors, (4303), 3486 states have internal predecessors, (4303), 474 states have call successors, (474), 329 states have call predecessors, (474), 436 states have return successors, (637), 533 states have call predecessors, (637), 472 states have call successors, (637) [2022-11-02 20:18:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5414 transitions. [2022-11-02 20:18:14,104 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5414 transitions. Word has length 163 [2022-11-02 20:18:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:14,104 INFO L495 AbstractCegarLoop]: Abstraction has 4347 states and 5414 transitions. [2022-11-02 20:18:14,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:18:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5414 transitions. [2022-11-02 20:18:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:14,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:14,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:14,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:18:14,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fe1c6cd-0fcd-40c5-8eb4-6b77ac5cde13/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:18:14,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 96232972, now seen corresponding path program 1 times [2022-11-02 20:18:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:14,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569112331] [2022-11-02 20:18:14,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:14,584 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:18:14,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:14,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569112331] [2022-11-02 20:18:14,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569112331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:14,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:14,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:14,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954119541] [2022-11-02 20:18:14,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:14,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:14,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:14,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:14,587 INFO L87 Difference]: Start difference. First operand 4347 states and 5414 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:18:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:17,963 INFO L93 Difference]: Finished difference Result 4860 states and 6246 transitions. [2022-11-02 20:18:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:17,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:17,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:18,002 INFO L225 Difference]: With dead ends: 4860 [2022-11-02 20:18:18,002 INFO L226 Difference]: Without dead ends: 4489 [2022-11-02 20:18:18,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:18,006 INFO L413 NwaCegarLoop]: 799 mSDtfsCounter, 1140 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:18,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 1382 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:18:18,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2022-11-02 20:18:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4347. [2022-11-02 20:18:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 3435 states have (on average 1.252401746724891) internal successors, (4302), 3486 states have internal predecessors, (4302), 474 states have call successors, (474), 329 states have call predecessors, (474), 436 states have return successors, (637), 533 states have call predecessors, (637), 472 states have call successors, (637) [2022-11-02 20:18:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5413 transitions. [2022-11-02 20:18:19,001 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5413 transitions. Word has length 178 [2022-11-02 20:18:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:19,002 INFO L495 AbstractCegarLoop]: Abstraction has 4347 states and 5413 transitions. [2022-11-02 20:18:19,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:18:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5413 transitions. [2022-11-02 20:18:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:19,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:19,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:18:19,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1599331278, now seen corresponding path program 1 times [2022-11-02 20:18:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:19,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983652001] [2022-11-02 20:18:19,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:19,245 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:18:19,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:19,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983652001] [2022-11-02 20:18:19,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983652001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:19,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:19,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:18:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602828872] [2022-11-02 20:18:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:18:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:18:19,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:18:19,248 INFO L87 Difference]: Start difference. First operand 4347 states and 5413 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:18:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:22,349 INFO L93 Difference]: Finished difference Result 4852 states and 6229 transitions. [2022-11-02 20:18:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:22,376 INFO L225 Difference]: With dead ends: 4852 [2022-11-02 20:18:22,376 INFO L226 Difference]: Without dead ends: 4489 [2022-11-02 20:18:22,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:22,383 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 1131 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:22,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1380 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:18:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2022-11-02 20:18:23,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 4347. [2022-11-02 20:18:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4347 states, 3435 states have (on average 1.2521106259097525) internal successors, (4301), 3486 states have internal predecessors, (4301), 474 states have call successors, (474), 329 states have call predecessors, (474), 436 states have return successors, (637), 533 states have call predecessors, (637), 472 states have call successors, (637) [2022-11-02 20:18:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5412 transitions. [2022-11-02 20:18:23,449 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5412 transitions. Word has length 178 [2022-11-02 20:18:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:23,450 INFO L495 AbstractCegarLoop]: Abstraction has 4347 states and 5412 transitions. [2022-11-02 20:18:23,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:18:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5412 transitions. [2022-11-02 20:18:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:23,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:23,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:18:23,456 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1029059472, now seen corresponding path program 1 times [2022-11-02 20:18:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:23,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098164848] [2022-11-02 20:18:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:23,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:23,806 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:18:23,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:23,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098164848] [2022-11-02 20:18:23,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098164848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:23,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:23,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:18:23,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828487398] [2022-11-02 20:18:23,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:23,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:18:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:23,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:18:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:18:23,810 INFO L87 Difference]: Start difference. First operand 4347 states and 5412 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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:18:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:28,986 INFO L93 Difference]: Finished difference Result 5363 states and 7059 transitions. [2022-11-02 20:18:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:18:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:29,006 INFO L225 Difference]: With dead ends: 5363 [2022-11-02 20:18:29,006 INFO L226 Difference]: Without dead ends: 5006 [2022-11-02 20:18:29,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:18:29,010 INFO L413 NwaCegarLoop]: 836 mSDtfsCounter, 1793 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1824 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:29,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1824 Valid, 1958 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 20:18:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5006 states. [2022-11-02 20:18:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5006 to 4723. [2022-11-02 20:18:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4723 states, 3783 states have (on average 1.2839016653449644) internal successors, (4857), 3835 states have internal predecessors, (4857), 495 states have call successors, (495), 335 states have call predecessors, (495), 443 states have return successors, (661), 554 states have call predecessors, (661), 493 states have call successors, (661) [2022-11-02 20:18:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 6013 transitions. [2022-11-02 20:18:29,746 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 6013 transitions. Word has length 178 [2022-11-02 20:18:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:29,747 INFO L495 AbstractCegarLoop]: Abstraction has 4723 states and 6013 transitions. [2022-11-02 20:18:29,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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:18:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 6013 transitions. [2022-11-02 20:18:29,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:29,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:29,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:18:29,752 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash 153074196, now seen corresponding path program 1 times [2022-11-02 20:18:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:29,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440526968] [2022-11-02 20:18:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:30,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:30,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:30,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:30,125 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:18:30,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:30,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440526968] [2022-11-02 20:18:30,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440526968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:30,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:30,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29072167] [2022-11-02 20:18:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:30,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:30,131 INFO L87 Difference]: Start difference. First operand 4723 states and 6013 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:36,222 INFO L93 Difference]: Finished difference Result 6278 states and 8539 transitions. [2022-11-02 20:18:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:18:36,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:36,246 INFO L225 Difference]: With dead ends: 6278 [2022-11-02 20:18:36,246 INFO L226 Difference]: Without dead ends: 5545 [2022-11-02 20:18:36,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:18:36,251 INFO L413 NwaCegarLoop]: 1133 mSDtfsCounter, 1826 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 3337 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 3242 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:36,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 3242 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3337 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-02 20:18:36,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2022-11-02 20:18:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 5073. [2022-11-02 20:18:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 4105 states have (on average 1.3059683313032886) internal successors, (5361), 4158 states have internal predecessors, (5361), 516 states have call successors, (516), 341 states have call predecessors, (516), 450 states have return successors, (684), 576 states have call predecessors, (684), 514 states have call successors, (684) [2022-11-02 20:18:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 6561 transitions. [2022-11-02 20:18:37,134 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 6561 transitions. Word has length 178 [2022-11-02 20:18:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:37,135 INFO L495 AbstractCegarLoop]: Abstraction has 5073 states and 6561 transitions. [2022-11-02 20:18:37,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 6561 transitions. [2022-11-02 20:18:37,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:37,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:37,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:37,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:18:37,142 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:37,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1252117482, now seen corresponding path program 1 times [2022-11-02 20:18:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:37,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959131455] [2022-11-02 20:18:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:37,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:37,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:37,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:37,432 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:18:37,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:37,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959131455] [2022-11-02 20:18:37,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959131455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:37,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:37,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:37,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116676494] [2022-11-02 20:18:37,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:37,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:37,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:37,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:37,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:37,436 INFO L87 Difference]: Start difference. First operand 5073 states and 6561 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:41,444 INFO L93 Difference]: Finished difference Result 6646 states and 9127 transitions. [2022-11-02 20:18:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:41,462 INFO L225 Difference]: With dead ends: 6646 [2022-11-02 20:18:41,462 INFO L226 Difference]: Without dead ends: 5563 [2022-11-02 20:18:41,468 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:18:41,468 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 1356 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:41,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 1943 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 20:18:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2022-11-02 20:18:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 5073. [2022-11-02 20:18:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 4105 states have (on average 1.305237515225335) internal successors, (5358), 4158 states have internal predecessors, (5358), 516 states have call successors, (516), 341 states have call predecessors, (516), 450 states have return successors, (684), 576 states have call predecessors, (684), 514 states have call successors, (684) [2022-11-02 20:18:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 6558 transitions. [2022-11-02 20:18:42,192 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 6558 transitions. Word has length 178 [2022-11-02 20:18:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:42,192 INFO L495 AbstractCegarLoop]: Abstraction has 5073 states and 6558 transitions. [2022-11-02 20:18:42,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 6558 transitions. [2022-11-02 20:18:42,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:42,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:42,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:42,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:18:42,198 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:42,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash 642216404, now seen corresponding path program 1 times [2022-11-02 20:18:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:42,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454218153] [2022-11-02 20:18:42,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:42,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:18:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:42,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454218153] [2022-11-02 20:18:42,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454218153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:42,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:42,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213101649] [2022-11-02 20:18:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:42,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:42,491 INFO L87 Difference]: Start difference. First operand 5073 states and 6558 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:46,246 INFO L93 Difference]: Finished difference Result 6642 states and 9110 transitions. [2022-11-02 20:18:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:46,266 INFO L225 Difference]: With dead ends: 6642 [2022-11-02 20:18:46,266 INFO L226 Difference]: Without dead ends: 5559 [2022-11-02 20:18:46,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:18:46,274 INFO L413 NwaCegarLoop]: 727 mSDtfsCounter, 1440 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1895 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:46,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1895 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:18:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5559 states. [2022-11-02 20:18:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5559 to 5073. [2022-11-02 20:18:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5073 states, 4105 states have (on average 1.3045066991473813) internal successors, (5355), 4158 states have internal predecessors, (5355), 516 states have call successors, (516), 341 states have call predecessors, (516), 450 states have return successors, (684), 576 states have call predecessors, (684), 514 states have call successors, (684) [2022-11-02 20:18:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5073 states to 5073 states and 6555 transitions. [2022-11-02 20:18:47,086 INFO L78 Accepts]: Start accepts. Automaton has 5073 states and 6555 transitions. Word has length 178 [2022-11-02 20:18:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:47,086 INFO L495 AbstractCegarLoop]: Abstraction has 5073 states and 6555 transitions. [2022-11-02 20:18:47,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5073 states and 6555 transitions. [2022-11-02 20:18:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:47,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:47,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:47,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:18:47,092 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:47,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2088797270, now seen corresponding path program 1 times [2022-11-02 20:18:47,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:47,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927277454] [2022-11-02 20:18:47,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:47,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:47,405 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:18:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:47,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927277454] [2022-11-02 20:18:47,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927277454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:47,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:47,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658263732] [2022-11-02 20:18:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:47,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:47,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:47,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:47,408 INFO L87 Difference]: Start difference. First operand 5073 states and 6555 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:53,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:53,908 INFO L93 Difference]: Finished difference Result 7617 states and 10651 transitions. [2022-11-02 20:18:53,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:18:53,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:53,936 INFO L225 Difference]: With dead ends: 7617 [2022-11-02 20:18:53,936 INFO L226 Difference]: Without dead ends: 6534 [2022-11-02 20:18:53,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:18:53,943 INFO L413 NwaCegarLoop]: 1114 mSDtfsCounter, 1808 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 3279 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1839 SdHoareTripleChecker+Valid, 3223 SdHoareTripleChecker+Invalid, 3403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:53,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1839 Valid, 3223 Invalid, 3403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3279 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-02 20:18:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2022-11-02 20:18:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 5782. [2022-11-02 20:18:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 4758 states have (on average 1.33921815889029) internal successors, (6372), 4813 states have internal predecessors, (6372), 558 states have call successors, (558), 353 states have call predecessors, (558), 464 states have return successors, (734), 620 states have call predecessors, (734), 556 states have call successors, (734) [2022-11-02 20:18:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 7664 transitions. [2022-11-02 20:18:54,806 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 7664 transitions. Word has length 178 [2022-11-02 20:18:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:54,807 INFO L495 AbstractCegarLoop]: Abstraction has 5782 states and 7664 transitions. [2022-11-02 20:18:54,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 7664 transitions. [2022-11-02 20:18:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:54,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:54,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:54,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:18:54,813 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1165629844, now seen corresponding path program 1 times [2022-11-02 20:18:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:54,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363949817] [2022-11-02 20:18:54,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:54,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:18:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:18:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:18:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:18:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:18:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:55,096 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:18:55,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:55,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363949817] [2022-11-02 20:18:55,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363949817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:55,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:55,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930381358] [2022-11-02 20:18:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:55,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:55,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:55,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:55,099 INFO L87 Difference]: Start difference. First operand 5782 states and 7664 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:59,092 INFO L93 Difference]: Finished difference Result 8314 states and 11749 transitions. [2022-11-02 20:18:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:18:59,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:18:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:59,126 INFO L225 Difference]: With dead ends: 8314 [2022-11-02 20:18:59,126 INFO L226 Difference]: Without dead ends: 6522 [2022-11-02 20:18:59,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:18:59,136 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 1353 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:59,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1932 Invalid, 1727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 20:18:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6522 states. [2022-11-02 20:18:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6522 to 5782. [2022-11-02 20:18:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5782 states, 4758 states have (on average 1.3381672971836907) internal successors, (6367), 4813 states have internal predecessors, (6367), 558 states have call successors, (558), 353 states have call predecessors, (558), 464 states have return successors, (734), 620 states have call predecessors, (734), 556 states have call successors, (734) [2022-11-02 20:18:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5782 states to 5782 states and 7659 transitions. [2022-11-02 20:18:59,989 INFO L78 Accepts]: Start accepts. Automaton has 5782 states and 7659 transitions. Word has length 178 [2022-11-02 20:18:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:59,990 INFO L495 AbstractCegarLoop]: Abstraction has 5782 states and 7659 transitions. [2022-11-02 20:18:59,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:18:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 5782 states and 7659 transitions. [2022-11-02 20:18:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:18:59,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:59,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:59,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:18:59,996 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:18:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1551492246, now seen corresponding path program 1 times [2022-11-02 20:18:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:59,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239406142] [2022-11-02 20:18:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:00,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:00,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:00,391 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:19:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:00,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239406142] [2022-11-02 20:19:00,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239406142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:00,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:00,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958353613] [2022-11-02 20:19:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:00,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:00,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:00,395 INFO L87 Difference]: Start difference. First operand 5782 states and 7659 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:07,223 INFO L93 Difference]: Finished difference Result 10210 states and 14728 transitions. [2022-11-02 20:19:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:19:07,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:07,254 INFO L225 Difference]: With dead ends: 10210 [2022-11-02 20:19:07,255 INFO L226 Difference]: Without dead ends: 8418 [2022-11-02 20:19:07,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:19:07,265 INFO L413 NwaCegarLoop]: 1103 mSDtfsCounter, 1800 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 3252 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 3212 SdHoareTripleChecker+Invalid, 3376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 3252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:07,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 3212 Invalid, 3376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 3252 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-02 20:19:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8418 states. [2022-11-02 20:19:08,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8418 to 7204. [2022-11-02 20:19:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 6068 states have (on average 1.3841463414634145) internal successors, (8399), 6127 states have internal predecessors, (8399), 642 states have call successors, (642), 377 states have call predecessors, (642), 492 states have return successors, (840), 708 states have call predecessors, (840), 640 states have call successors, (840) [2022-11-02 20:19:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 9881 transitions. [2022-11-02 20:19:08,542 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 9881 transitions. Word has length 178 [2022-11-02 20:19:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:08,542 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 9881 transitions. [2022-11-02 20:19:08,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 9881 transitions. [2022-11-02 20:19:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:08,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:08,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:08,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:19:08,549 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1286844756, now seen corresponding path program 1 times [2022-11-02 20:19:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:08,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245246216] [2022-11-02 20:19:08,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:08,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:08,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:08,853 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:19:08,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:08,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245246216] [2022-11-02 20:19:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245246216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:08,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:08,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060070249] [2022-11-02 20:19:08,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:08,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:08,859 INFO L87 Difference]: Start difference. First operand 7204 states and 9881 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:13,002 INFO L93 Difference]: Finished difference Result 11654 states and 17020 transitions. [2022-11-02 20:19:13,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:13,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:13,033 INFO L225 Difference]: With dead ends: 11654 [2022-11-02 20:19:13,033 INFO L226 Difference]: Without dead ends: 8440 [2022-11-02 20:19:13,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:19:13,045 INFO L413 NwaCegarLoop]: 755 mSDtfsCounter, 1354 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:13,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 1923 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-02 20:19:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2022-11-02 20:19:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 7204. [2022-11-02 20:19:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 6068 states have (on average 1.3826631509558338) internal successors, (8390), 6127 states have internal predecessors, (8390), 642 states have call successors, (642), 377 states have call predecessors, (642), 492 states have return successors, (840), 708 states have call predecessors, (840), 640 states have call successors, (840) [2022-11-02 20:19:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 9872 transitions. [2022-11-02 20:19:14,398 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 9872 transitions. Word has length 178 [2022-11-02 20:19:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:14,399 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 9872 transitions. [2022-11-02 20:19:14,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 9872 transitions. [2022-11-02 20:19:14,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:14,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:14,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:19:14,404 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1076996906, now seen corresponding path program 1 times [2022-11-02 20:19:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:14,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930533053] [2022-11-02 20:19:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:14,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:14,677 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:19:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:14,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930533053] [2022-11-02 20:19:14,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930533053] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:14,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:14,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822797562] [2022-11-02 20:19:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:14,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:14,681 INFO L87 Difference]: Start difference. First operand 7204 states and 9872 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:18,590 INFO L93 Difference]: Finished difference Result 11634 states and 16953 transitions. [2022-11-02 20:19:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:18,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:18,618 INFO L225 Difference]: With dead ends: 11634 [2022-11-02 20:19:18,618 INFO L226 Difference]: Without dead ends: 8420 [2022-11-02 20:19:18,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:19:18,628 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 1572 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:18,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 1664 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-02 20:19:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8420 states. [2022-11-02 20:19:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8420 to 7204. [2022-11-02 20:19:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 6068 states have (on average 1.381179960448253) internal successors, (8381), 6127 states have internal predecessors, (8381), 642 states have call successors, (642), 377 states have call predecessors, (642), 492 states have return successors, (840), 708 states have call predecessors, (840), 640 states have call successors, (840) [2022-11-02 20:19:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 9863 transitions. [2022-11-02 20:19:20,038 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 9863 transitions. Word has length 178 [2022-11-02 20:19:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:20,038 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 9863 transitions. [2022-11-02 20:19:20,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 9863 transitions. [2022-11-02 20:19:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:20,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:19:20,044 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 819982552, now seen corresponding path program 1 times [2022-11-02 20:19:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410186460] [2022-11-02 20:19:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,326 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:19:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:20,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410186460] [2022-11-02 20:19:20,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410186460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:20,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:20,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:20,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341048012] [2022-11-02 20:19:20,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:20,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:20,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:20,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:20,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:20,331 INFO L87 Difference]: Start difference. First operand 7204 states and 9863 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:24,396 INFO L93 Difference]: Finished difference Result 11624 states and 16906 transitions. [2022-11-02 20:19:24,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:24,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:24,424 INFO L225 Difference]: With dead ends: 11624 [2022-11-02 20:19:24,425 INFO L226 Difference]: Without dead ends: 8410 [2022-11-02 20:19:24,436 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:19:24,436 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 1349 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:24,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1913 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-02 20:19:24,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8410 states. [2022-11-02 20:19:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8410 to 7204. [2022-11-02 20:19:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7204 states, 6068 states have (on average 1.3796967699406724) internal successors, (8372), 6127 states have internal predecessors, (8372), 642 states have call successors, (642), 377 states have call predecessors, (642), 492 states have return successors, (840), 708 states have call predecessors, (840), 640 states have call successors, (840) [2022-11-02 20:19:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7204 states to 7204 states and 9854 transitions. [2022-11-02 20:19:25,770 INFO L78 Accepts]: Start accepts. Automaton has 7204 states and 9854 transitions. Word has length 178 [2022-11-02 20:19:25,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:25,771 INFO L495 AbstractCegarLoop]: Abstraction has 7204 states and 9854 transitions. [2022-11-02 20:19:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:25,771 INFO L276 IsEmpty]: Start isEmpty. Operand 7204 states and 9854 transitions. [2022-11-02 20:19:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:25,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:25,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:25,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:19:25,777 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1158270102, now seen corresponding path program 1 times [2022-11-02 20:19:25,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:25,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494005731] [2022-11-02 20:19:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:25,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:26,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:26,083 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:19:26,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:26,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494005731] [2022-11-02 20:19:26,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494005731] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:26,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:26,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161476624] [2022-11-02 20:19:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:26,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:26,086 INFO L87 Difference]: Start difference. First operand 7204 states and 9854 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:33,458 INFO L93 Difference]: Finished difference Result 15366 states and 22732 transitions. [2022-11-02 20:19:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:19:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:33,493 INFO L225 Difference]: With dead ends: 15366 [2022-11-02 20:19:33,494 INFO L226 Difference]: Without dead ends: 12152 [2022-11-02 20:19:33,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:19:33,504 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 1864 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 2293 SdHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:33,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 2293 Invalid, 3038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 20:19:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12152 states. [2022-11-02 20:19:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12152 to 10089. [2022-11-02 20:19:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10089 states, 8729 states have (on average 1.428113185931951) internal successors, (12466), 8796 states have internal predecessors, (12466), 810 states have call successors, (810), 425 states have call predecessors, (810), 548 states have return successors, (1070), 884 states have call predecessors, (1070), 808 states have call successors, (1070) [2022-11-02 20:19:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10089 states to 10089 states and 14346 transitions. [2022-11-02 20:19:35,489 INFO L78 Accepts]: Start accepts. Automaton has 10089 states and 14346 transitions. Word has length 178 [2022-11-02 20:19:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:35,490 INFO L495 AbstractCegarLoop]: Abstraction has 10089 states and 14346 transitions. [2022-11-02 20:19:35,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10089 states and 14346 transitions. [2022-11-02 20:19:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:35,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:35,497 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:35,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:19:35,498 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:35,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:35,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1584824600, now seen corresponding path program 1 times [2022-11-02 20:19:35,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:35,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308167102] [2022-11-02 20:19:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:35,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,746 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:19:35,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:35,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308167102] [2022-11-02 20:19:35,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308167102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:35,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:35,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314232897] [2022-11-02 20:19:35,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:35,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:35,749 INFO L87 Difference]: Start difference. First operand 10089 states and 14346 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:40,150 INFO L93 Difference]: Finished difference Result 18310 states and 27413 transitions. [2022-11-02 20:19:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:40,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:40,185 INFO L225 Difference]: With dead ends: 18310 [2022-11-02 20:19:40,185 INFO L226 Difference]: Without dead ends: 12211 [2022-11-02 20:19:40,200 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:19:40,200 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 1567 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:40,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 1651 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:19:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12211 states. [2022-11-02 20:19:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12211 to 10089. [2022-11-02 20:19:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10089 states, 8729 states have (on average 1.4261656547141712) internal successors, (12449), 8796 states have internal predecessors, (12449), 810 states have call successors, (810), 425 states have call predecessors, (810), 548 states have return successors, (1070), 884 states have call predecessors, (1070), 808 states have call successors, (1070) [2022-11-02 20:19:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10089 states to 10089 states and 14329 transitions. [2022-11-02 20:19:42,067 INFO L78 Accepts]: Start accepts. Automaton has 10089 states and 14329 transitions. Word has length 178 [2022-11-02 20:19:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:42,067 INFO L495 AbstractCegarLoop]: Abstraction has 10089 states and 14329 transitions. [2022-11-02 20:19:42,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 10089 states and 14329 transitions. [2022-11-02 20:19:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:42,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:42,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:42,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:19:42,073 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:42,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1044395094, now seen corresponding path program 1 times [2022-11-02 20:19:42,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:42,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49066499] [2022-11-02 20:19:42,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:42,328 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:19:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:42,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49066499] [2022-11-02 20:19:42,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49066499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:42,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:42,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204755953] [2022-11-02 20:19:42,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:42,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:42,331 INFO L87 Difference]: Start difference. First operand 10089 states and 14329 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:53,595 INFO L93 Difference]: Finished difference Result 28383 states and 43048 transitions. [2022-11-02 20:19:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:19:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:19:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:53,657 INFO L225 Difference]: With dead ends: 28383 [2022-11-02 20:19:53,657 INFO L226 Difference]: Without dead ends: 22284 [2022-11-02 20:19:53,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:19:53,672 INFO L413 NwaCegarLoop]: 1060 mSDtfsCounter, 2215 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2259 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:53,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2259 Valid, 3158 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-02 20:19:53,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22284 states. [2022-11-02 20:19:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22284 to 15755. [2022-11-02 20:19:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15755 states, 13963 states have (on average 1.4670915992265272) internal successors, (20485), 14046 states have internal predecessors, (20485), 1130 states have call successors, (1130), 521 states have call predecessors, (1130), 660 states have return successors, (1568), 1220 states have call predecessors, (1568), 1128 states have call successors, (1568) [2022-11-02 20:19:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15755 states to 15755 states and 23183 transitions. [2022-11-02 20:19:56,671 INFO L78 Accepts]: Start accepts. Automaton has 15755 states and 23183 transitions. Word has length 178 [2022-11-02 20:19:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:56,671 INFO L495 AbstractCegarLoop]: Abstraction has 15755 states and 23183 transitions. [2022-11-02 20:19:56,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:19:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 15755 states and 23183 transitions. [2022-11-02 20:19:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:19:56,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:56,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:56,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:19:56,680 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 888414552, now seen corresponding path program 1 times [2022-11-02 20:19:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:56,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194041317] [2022-11-02 20:19:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:19:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:19:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:19:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:19:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:19:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,960 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:19:56,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:56,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194041317] [2022-11-02 20:19:56,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194041317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:56,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:56,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:56,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278630621] [2022-11-02 20:19:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:56,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:56,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:56,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:56,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:56,962 INFO L87 Difference]: Start difference. First operand 15755 states and 23183 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:16,745 INFO L93 Difference]: Finished difference Result 51007 states and 78672 transitions. [2022-11-02 20:20:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:20:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:20:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:16,903 INFO L225 Difference]: With dead ends: 51007 [2022-11-02 20:20:16,903 INFO L226 Difference]: Without dead ends: 39242 [2022-11-02 20:20:16,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:20:16,950 INFO L413 NwaCegarLoop]: 1228 mSDtfsCounter, 1871 mSDsluCounter, 2101 mSDsCounter, 0 mSdLazyCounter, 3646 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 3329 SdHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:16,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 3329 Invalid, 3775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3646 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-02 20:20:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39242 states. [2022-11-02 20:20:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39242 to 27148. [2022-11-02 20:20:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27148 states, 24508 states have (on average 1.497266198792231) internal successors, (36695), 24623 states have internal predecessors, (36695), 1754 states have call successors, (1754), 713 states have call predecessors, (1754), 884 states have return successors, (2710), 1876 states have call predecessors, (2710), 1752 states have call successors, (2710) [2022-11-02 20:20:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27148 states to 27148 states and 41159 transitions. [2022-11-02 20:20:24,179 INFO L78 Accepts]: Start accepts. Automaton has 27148 states and 41159 transitions. Word has length 178 [2022-11-02 20:20:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:24,179 INFO L495 AbstractCegarLoop]: Abstraction has 27148 states and 41159 transitions. [2022-11-02 20:20:24,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:24,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27148 states and 41159 transitions. [2022-11-02 20:20:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:20:24,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:24,200 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:20:24,201 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1299024918, now seen corresponding path program 1 times [2022-11-02 20:20:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:24,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436608114] [2022-11-02 20:20:24,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:24,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:24,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:20:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:20:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:20:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:24,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:20:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:24,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:24,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:24,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436608114] [2022-11-02 20:20:24,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436608114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:24,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:24,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721634824] [2022-11-02 20:20:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:24,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:24,604 INFO L87 Difference]: Start difference. First operand 27148 states and 41159 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:39,551 INFO L93 Difference]: Finished difference Result 57718 states and 90170 transitions. [2022-11-02 20:20:39,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:20:39,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 178 [2022-11-02 20:20:39,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:39,685 INFO L225 Difference]: With dead ends: 57718 [2022-11-02 20:20:39,685 INFO L226 Difference]: Without dead ends: 34560 [2022-11-02 20:20:39,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:20:39,763 INFO L413 NwaCegarLoop]: 726 mSDtfsCounter, 1348 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:39,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1892 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 20:20:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34560 states. [2022-11-02 20:20:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34560 to 27148. [2022-11-02 20:20:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27148 states, 24508 states have (on average 1.4946140035906643) internal successors, (36630), 24623 states have internal predecessors, (36630), 1754 states have call successors, (1754), 713 states have call predecessors, (1754), 884 states have return successors, (2710), 1876 states have call predecessors, (2710), 1752 states have call successors, (2710) [2022-11-02 20:20:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27148 states to 27148 states and 41094 transitions. [2022-11-02 20:20:47,621 INFO L78 Accepts]: Start accepts. Automaton has 27148 states and 41094 transitions. Word has length 178 [2022-11-02 20:20:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:47,622 INFO L495 AbstractCegarLoop]: Abstraction has 27148 states and 41094 transitions. [2022-11-02 20:20:47,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27148 states and 41094 transitions. [2022-11-02 20:20:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:20:47,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:47,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:20:47,633 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:20:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash -488844904, now seen corresponding path program 1 times [2022-11-02 20:20:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848985650] [2022-11-02 20:20:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:20:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:20:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-02 20:20:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:20:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 20:20:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:47,960 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:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:47,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848985650] [2022-11-02 20:20:47,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848985650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:47,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:47,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:20:47,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468748896] [2022-11-02 20:20:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:47,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:20:47,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:20:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:20:47,963 INFO L87 Difference]: Start difference. First operand 27148 states and 41094 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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)