./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/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_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/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 64bit --witnessprinter.graph.data.programhash 5c2ae4f9e22cc68a37a2a30aa0a104b47e23e2c796ef551349d7d369f3cb3d78 --- 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 21:08:46,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:08:46,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:08:46,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:08:46,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:08:46,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:08:46,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:08:46,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:08:46,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:08:46,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:08:46,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:08:46,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:08:46,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:08:46,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:08:46,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:08:46,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:08:46,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:08:46,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:08:46,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:08:46,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:08:46,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:08:46,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:08:46,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:08:46,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:08:46,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:08:46,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:08:46,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:08:46,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:08:46,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:08:46,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:08:46,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:08:46,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:08:46,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:08:46,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:08:46,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:08:46,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:08:46,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:08:46,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:08:46,964 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:08:46,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:08:46,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:08:46,967 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:08:47,007 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:08:47,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:08:47,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:08:47,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:08:47,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:08:47,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:08:47,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:08:47,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:08:47,011 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:08:47,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:08:47,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:08:47,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:08:47,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:08:47,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:08:47,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:08:47,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:08:47,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:08:47,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:08:47,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:08:47,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:08:47,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:08:47,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:47,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:08:47,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:08:47,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:08:47,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:08:47,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:08:47,019 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:08:47,019 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:08:47,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:08:47,020 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_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/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_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5c2ae4f9e22cc68a37a2a30aa0a104b47e23e2c796ef551349d7d369f3cb3d78 [2022-11-02 21:08:47,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:08:47,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:08:47,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:08:47,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:08:47,376 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:08:47,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i [2022-11-02 21:08:47,465 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/data/33576df3a/3c78155785b9482a8147605914bfb0d7/FLAG96c7f722a [2022-11-02 21:08:48,458 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:08:48,463 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i [2022-11-02 21:08:48,510 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/data/33576df3a/3c78155785b9482a8147605914bfb0d7/FLAG96c7f722a [2022-11-02 21:08:48,915 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/data/33576df3a/3c78155785b9482a8147605914bfb0d7 [2022-11-02 21:08:48,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:08:48,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:08:48,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:48,921 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:08:48,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:08:48,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:48" (1/1) ... [2022-11-02 21:08:48,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c34518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:48, skipping insertion in model container [2022-11-02 21:08:48,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:48" (1/1) ... [2022-11-02 21:08:48,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:08:49,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:08:50,276 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_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i[239090,239103] [2022-11-02 21:08:50,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:50,552 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:08:50,846 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_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i[239090,239103] [2022-11-02 21:08:50,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:51,019 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:08:51,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51 WrapperNode [2022-11-02 21:08:51,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:51,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:51,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:08:51,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:08:51,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,177 INFO L138 Inliner]: procedures = 170, calls = 847, calls flagged for inlining = 47, calls inlined = 39, statements flattened = 1558 [2022-11-02 21:08:51,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:51,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:08:51,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:08:51,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:08:51,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,292 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:08:51,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:08:51,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:08:51,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:08:51,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (1/1) ... [2022-11-02 21:08:51,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:51,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:51,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:08:51,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa3288ef-a2d8-4963-bbf8-3a5022749d2e/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:08:51,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 21:08:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure opera1_power_ctrl [2022-11-02 21:08:51,429 INFO L138 BoogieDeclarations]: Found implementation of procedure opera1_power_ctrl [2022-11-02 21:08:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 21:08:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 21:08:51,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:08:51,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:08:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:08:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 21:08:51,430 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 21:08:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 21:08:51,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 21:08:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure stv0299_writereg [2022-11-02 21:08:51,431 INFO L138 BoogieDeclarations]: Found implementation of procedure stv0299_writereg [2022-11-02 21:08:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:08:51,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:08:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i2c_mutex_of_dvb_usb_device [2022-11-02 21:08:51,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i2c_mutex_of_dvb_usb_device [2022-11-02 21:08:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 21:08:51,432 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 21:08:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:08:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 21:08:51,432 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 21:08:51,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 21:08:51,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 21:08:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure opera1_xilinx_rw [2022-11-02 21:08:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure opera1_xilinx_rw [2022-11-02 21:08:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_transfer [2022-11-02 21:08:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_transfer [2022-11-02 21:08:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 21:08:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 21:08:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:08:51,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:08:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_usb_mutex_of_dvb_usb_device [2022-11-02 21:08:51,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_usb_mutex_of_dvb_usb_device [2022-11-02 21:08:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:08:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure opera1_rc_query [2022-11-02 21:08:51,435 INFO L138 BoogieDeclarations]: Found implementation of procedure opera1_rc_query [2022-11-02 21:08:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-02 21:08:51,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-02 21:08:51,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:08:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 21:08:51,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 21:08:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:08:51,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:08:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:08:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 21:08:51,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 21:08:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-11-02 21:08:51,437 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-11-02 21:08:51,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:08:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:08:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure opera1_i2c_xfer [2022-11-02 21:08:51,438 INFO L138 BoogieDeclarations]: Found implementation of procedure opera1_i2c_xfer [2022-11-02 21:08:51,438 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 21:08:51,439 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 21:08:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-11-02 21:08:51,440 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-11-02 21:08:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:08:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-11-02 21:08:51,442 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-11-02 21:08:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 21:08:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:08:51,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:08:51,991 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:08:51,996 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:08:52,360 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:09:03,464 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:09:03,476 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:09:03,479 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:09:03,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:03 BoogieIcfgContainer [2022-11-02 21:09:03,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:09:03,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:09:03,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:09:03,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:09:03,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:08:48" (1/3) ... [2022-11-02 21:09:03,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8bceb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:03, skipping insertion in model container [2022-11-02 21:09:03,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:51" (2/3) ... [2022-11-02 21:09:03,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8bceb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:03, skipping insertion in model container [2022-11-02 21:09:03,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:03" (3/3) ... [2022-11-02 21:09:03,493 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--media--usb--dvb-usb--dvb-usb-opera.ko-entry_point.cil.out.i [2022-11-02 21:09:03,517 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:09:03,517 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:09:03,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:09:03,583 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;@452f8951, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:09:03,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:09:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 383 states, 284 states have (on average 1.4014084507042253) internal successors, (398), 300 states have internal predecessors, (398), 74 states have call successors, (74), 24 states have call predecessors, (74), 23 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-02 21:09:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 21:09:03,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:03,604 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:03,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2016544780, now seen corresponding path program 1 times [2022-11-02 21:09:03,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:03,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633879358] [2022-11-02 21:09:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:04,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-02 21:09:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:04,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633879358] [2022-11-02 21:09:04,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633879358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:04,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:04,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:09:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457441229] [2022-11-02 21:09:04,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:04,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:09:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:09:04,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:09:04,983 INFO L87 Difference]: Start difference. First operand has 383 states, 284 states have (on average 1.4014084507042253) internal successors, (398), 300 states have internal predecessors, (398), 74 states have call successors, (74), 24 states have call predecessors, (74), 23 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 21:09:07,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:09,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:10,577 INFO L93 Difference]: Finished difference Result 891 states and 1347 transitions. [2022-11-02 21:09:10,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:09:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2022-11-02 21:09:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:10,596 INFO L225 Difference]: With dead ends: 891 [2022-11-02 21:09:10,596 INFO L226 Difference]: Without dead ends: 500 [2022-11-02 21:09:10,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:10,607 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 305 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 230 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:10,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1182 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 266 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:09:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-11-02 21:09:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 370. [2022-11-02 21:09:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 279 states have (on average 1.3727598566308243) internal successors, (383), 287 states have internal predecessors, (383), 68 states have call successors, (68), 23 states have call predecessors, (68), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-02 21:09:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 510 transitions. [2022-11-02 21:09:10,700 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 510 transitions. Word has length 141 [2022-11-02 21:09:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:10,700 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 510 transitions. [2022-11-02 21:09:10,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 21:09:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 510 transitions. [2022-11-02 21:09:10,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-02 21:09:10,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:10,704 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:10,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:09:10,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:10,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:10,705 INFO L85 PathProgramCache]: Analyzing trace with hash -892191384, now seen corresponding path program 1 times [2022-11-02 21:09:10,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:10,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928659265] [2022-11-02 21:09:10,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-02 21:09:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928659265] [2022-11-02 21:09:11,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928659265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:11,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:11,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:11,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916699283] [2022-11-02 21:09:11,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:11,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:11,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:11,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:11,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:11,522 INFO L87 Difference]: Start difference. First operand 370 states and 510 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-02 21:09:13,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:15,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:17,702 INFO L93 Difference]: Finished difference Result 1283 states and 1861 transitions. [2022-11-02 21:09:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 141 [2022-11-02 21:09:17,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:17,714 INFO L225 Difference]: With dead ends: 1283 [2022-11-02 21:09:17,714 INFO L226 Difference]: Without dead ends: 941 [2022-11-02 21:09:17,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:17,719 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 1435 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 724 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 724 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:17,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1343 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [724 Valid, 426 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 21:09:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-11-02 21:09:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 679. [2022-11-02 21:09:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 521 states have (on average 1.381957773512476) internal successors, (720), 529 states have internal predecessors, (720), 114 states have call successors, (114), 44 states have call predecessors, (114), 43 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2022-11-02 21:09:17,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 939 transitions. [2022-11-02 21:09:17,806 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 939 transitions. Word has length 141 [2022-11-02 21:09:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:17,812 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 939 transitions. [2022-11-02 21:09:17,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-02 21:09:17,812 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 939 transitions. [2022-11-02 21:09:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 21:09:17,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:17,821 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:17,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:09:17,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:17,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1814063057, now seen corresponding path program 1 times [2022-11-02 21:09:17,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:17,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647687159] [2022-11-02 21:09:17,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:09:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-02 21:09:18,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:18,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647687159] [2022-11-02 21:09:18,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647687159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:18,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:18,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:18,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082708410] [2022-11-02 21:09:18,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:18,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:18,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:18,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:18,630 INFO L87 Difference]: Start difference. First operand 679 states and 939 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:20,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:22,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:22,656 INFO L93 Difference]: Finished difference Result 2463 states and 3575 transitions. [2022-11-02 21:09:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:22,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 145 [2022-11-02 21:09:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:22,671 INFO L225 Difference]: With dead ends: 2463 [2022-11-02 21:09:22,672 INFO L226 Difference]: Without dead ends: 1812 [2022-11-02 21:09:22,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:22,682 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 1552 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 774 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:22,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 1300 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-02 21:09:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2022-11-02 21:09:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1286. [2022-11-02 21:09:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 994 states have (on average 1.3843058350100603) internal successors, (1376), 1003 states have internal predecessors, (1376), 206 states have call successors, (206), 86 states have call predecessors, (206), 85 states have return successors, (197), 196 states have call predecessors, (197), 197 states have call successors, (197) [2022-11-02 21:09:22,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1779 transitions. [2022-11-02 21:09:22,817 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1779 transitions. Word has length 145 [2022-11-02 21:09:22,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:22,818 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1779 transitions. [2022-11-02 21:09:22,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1779 transitions. [2022-11-02 21:09:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 21:09:22,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:22,827 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:22,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:09:22,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1455791905, now seen corresponding path program 1 times [2022-11-02 21:09:22,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:22,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298974668] [2022-11-02 21:09:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:22,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 21:09:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-11-02 21:09:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:23,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298974668] [2022-11-02 21:09:23,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298974668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:23,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:23,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:23,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468330570] [2022-11-02 21:09:23,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:23,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:23,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:23,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:23,641 INFO L87 Difference]: Start difference. First operand 1286 states and 1779 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:25,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:27,700 INFO L93 Difference]: Finished difference Result 4432 states and 6441 transitions. [2022-11-02 21:09:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 151 [2022-11-02 21:09:27,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:27,722 INFO L225 Difference]: With dead ends: 4432 [2022-11-02 21:09:27,722 INFO L226 Difference]: Without dead ends: 3174 [2022-11-02 21:09:27,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:27,729 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 1313 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 684 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:27,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1442 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [684 Valid, 398 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-02 21:09:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2022-11-02 21:09:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2292. [2022-11-02 21:09:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2292 states, 1788 states have (on average 1.3937360178970917) internal successors, (2492), 1799 states have internal predecessors, (2492), 350 states have call successors, (350), 154 states have call predecessors, (350), 153 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-11-02 21:09:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 3183 transitions. [2022-11-02 21:09:27,871 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 3183 transitions. Word has length 151 [2022-11-02 21:09:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:27,873 INFO L495 AbstractCegarLoop]: Abstraction has 2292 states and 3183 transitions. [2022-11-02 21:09:27,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 3183 transitions. [2022-11-02 21:09:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-02 21:09:27,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:27,875 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:27,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:09:27,876 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:27,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1603423522, now seen corresponding path program 1 times [2022-11-02 21:09:27,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:27,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585673573] [2022-11-02 21:09:27,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:27,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:09:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-11-02 21:09:28,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:28,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585673573] [2022-11-02 21:09:28,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585673573] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:28,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:28,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171323204] [2022-11-02 21:09:28,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:28,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:28,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:28,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:28,789 INFO L87 Difference]: Start difference. First operand 2292 states and 3183 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:30,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:32,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:34,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:37,590 INFO L93 Difference]: Finished difference Result 8426 states and 12428 transitions. [2022-11-02 21:09:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:37,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 161 [2022-11-02 21:09:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:37,635 INFO L225 Difference]: With dead ends: 8426 [2022-11-02 21:09:37,635 INFO L226 Difference]: Without dead ends: 6162 [2022-11-02 21:09:37,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:37,651 INFO L413 NwaCegarLoop]: 596 mSDtfsCounter, 1015 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 463 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:37,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 2019 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 637 Invalid, 3 Unknown, 0 Unchecked, 8.3s Time] [2022-11-02 21:09:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2022-11-02 21:09:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 4473. [2022-11-02 21:09:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 3509 states have (on average 1.3946993445426048) internal successors, (4894), 3523 states have internal predecessors, (4894), 664 states have call successors, (664), 301 states have call predecessors, (664), 299 states have return successors, (710), 648 states have call predecessors, (710), 654 states have call successors, (710) [2022-11-02 21:09:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 6268 transitions. [2022-11-02 21:09:38,052 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 6268 transitions. Word has length 161 [2022-11-02 21:09:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:38,052 INFO L495 AbstractCegarLoop]: Abstraction has 4473 states and 6268 transitions. [2022-11-02 21:09:38,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 6268 transitions. [2022-11-02 21:09:38,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 21:09:38,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:38,058 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:38,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:09:38,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1833539704, now seen corresponding path program 1 times [2022-11-02 21:09:38,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:38,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324854298] [2022-11-02 21:09:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:38,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:09:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:38,857 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-11-02 21:09:38,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:38,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324854298] [2022-11-02 21:09:38,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324854298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:38,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:38,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47063774] [2022-11-02 21:09:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:38,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:38,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:38,860 INFO L87 Difference]: Start difference. First operand 4473 states and 6268 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:40,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:42,397 INFO L93 Difference]: Finished difference Result 6117 states and 9151 transitions. [2022-11-02 21:09:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 162 [2022-11-02 21:09:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:42,439 INFO L225 Difference]: With dead ends: 6117 [2022-11-02 21:09:42,439 INFO L226 Difference]: Without dead ends: 6114 [2022-11-02 21:09:42,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:42,446 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 1008 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 424 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:42,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 857 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 180 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 21:09:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6114 states. [2022-11-02 21:09:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6114 to 4472. [2022-11-02 21:09:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4472 states, 3509 states have (on average 1.3944143630664008) internal successors, (4893), 3522 states have internal predecessors, (4893), 663 states have call successors, (663), 301 states have call predecessors, (663), 299 states have return successors, (710), 648 states have call predecessors, (710), 654 states have call successors, (710) [2022-11-02 21:09:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4472 states to 4472 states and 6266 transitions. [2022-11-02 21:09:42,773 INFO L78 Accepts]: Start accepts. Automaton has 4472 states and 6266 transitions. Word has length 162 [2022-11-02 21:09:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:42,773 INFO L495 AbstractCegarLoop]: Abstraction has 4472 states and 6266 transitions. [2022-11-02 21:09:42,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4472 states and 6266 transitions. [2022-11-02 21:09:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 21:09:42,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:42,776 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:42,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:09:42,777 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:42,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1005212443, now seen corresponding path program 1 times [2022-11-02 21:09:42,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:42,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822646978] [2022-11-02 21:09:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:42,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:09:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-11-02 21:09:43,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:43,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822646978] [2022-11-02 21:09:43,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822646978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:43,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:43,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810088580] [2022-11-02 21:09:43,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:43,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:43,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:43,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:43,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:43,579 INFO L87 Difference]: Start difference. First operand 4472 states and 6266 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:45,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:47,097 INFO L93 Difference]: Finished difference Result 6116 states and 9149 transitions. [2022-11-02 21:09:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 163 [2022-11-02 21:09:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:47,146 INFO L225 Difference]: With dead ends: 6116 [2022-11-02 21:09:47,146 INFO L226 Difference]: Without dead ends: 6113 [2022-11-02 21:09:47,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:47,152 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 931 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 343 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:47,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1054 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 254 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 21:09:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2022-11-02 21:09:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 4471. [2022-11-02 21:09:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4471 states, 3509 states have (on average 1.3941293815901967) internal successors, (4892), 3521 states have internal predecessors, (4892), 662 states have call successors, (662), 301 states have call predecessors, (662), 299 states have return successors, (710), 648 states have call predecessors, (710), 654 states have call successors, (710) [2022-11-02 21:09:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 6264 transitions. [2022-11-02 21:09:47,559 INFO L78 Accepts]: Start accepts. Automaton has 4471 states and 6264 transitions. Word has length 163 [2022-11-02 21:09:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:47,563 INFO L495 AbstractCegarLoop]: Abstraction has 4471 states and 6264 transitions. [2022-11-02 21:09:47,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4471 states and 6264 transitions. [2022-11-02 21:09:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-02 21:09:47,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:47,566 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:47,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:09:47,567 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1096866261, now seen corresponding path program 1 times [2022-11-02 21:09:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:47,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459038805] [2022-11-02 21:09:47,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:47,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:09:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-11-02 21:09:48,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:48,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459038805] [2022-11-02 21:09:48,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459038805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:48,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:48,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852892061] [2022-11-02 21:09:48,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:48,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:48,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:48,279 INFO L87 Difference]: Start difference. First operand 4471 states and 6264 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:50,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:52,171 INFO L93 Difference]: Finished difference Result 6115 states and 9147 transitions. [2022-11-02 21:09:52,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:52,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 164 [2022-11-02 21:09:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:52,203 INFO L225 Difference]: With dead ends: 6115 [2022-11-02 21:09:52,203 INFO L226 Difference]: Without dead ends: 6112 [2022-11-02 21:09:52,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:09:52,209 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 896 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 328 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:52,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1069 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 265 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 21:09:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6112 states. [2022-11-02 21:09:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6112 to 4470. [2022-11-02 21:09:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4470 states, 3509 states have (on average 1.3938444001139927) internal successors, (4891), 3520 states have internal predecessors, (4891), 661 states have call successors, (661), 301 states have call predecessors, (661), 299 states have return successors, (710), 648 states have call predecessors, (710), 654 states have call successors, (710) [2022-11-02 21:09:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4470 states to 4470 states and 6262 transitions. [2022-11-02 21:09:52,587 INFO L78 Accepts]: Start accepts. Automaton has 4470 states and 6262 transitions. Word has length 164 [2022-11-02 21:09:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:52,587 INFO L495 AbstractCegarLoop]: Abstraction has 4470 states and 6262 transitions. [2022-11-02 21:09:52,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4470 states and 6262 transitions. [2022-11-02 21:09:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-02 21:09:52,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:52,591 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:52,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:09:52,591 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:52,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash 356837544, now seen corresponding path program 1 times [2022-11-02 21:09:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:52,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596965589] [2022-11-02 21:09:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:09:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-11-02 21:09:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:53,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596965589] [2022-11-02 21:09:53,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596965589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:53,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:53,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:53,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110481846] [2022-11-02 21:09:53,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:53,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:53,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:53,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:53,325 INFO L87 Difference]: Start difference. First operand 4470 states and 6262 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:55,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:09:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:57,977 INFO L93 Difference]: Finished difference Result 16378 states and 24414 transitions. [2022-11-02 21:09:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:09:57,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 165 [2022-11-02 21:09:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:58,036 INFO L225 Difference]: With dead ends: 16378 [2022-11-02 21:09:58,037 INFO L226 Difference]: Without dead ends: 11927 [2022-11-02 21:09:58,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:09:58,064 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 1432 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 722 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:58,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1318 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 365 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-11-02 21:09:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11927 states. [2022-11-02 21:09:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11927 to 8715. [2022-11-02 21:09:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8715 states, 6871 states have (on average 1.3954300684034346) internal successors, (9588), 6899 states have internal predecessors, (9588), 1270 states have call successors, (1270), 576 states have call predecessors, (1270), 573 states have return successors, (1486), 1239 states have call predecessors, (1486), 1262 states have call successors, (1486) [2022-11-02 21:09:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8715 states to 8715 states and 12344 transitions. [2022-11-02 21:09:58,912 INFO L78 Accepts]: Start accepts. Automaton has 8715 states and 12344 transitions. Word has length 165 [2022-11-02 21:09:58,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:58,913 INFO L495 AbstractCegarLoop]: Abstraction has 8715 states and 12344 transitions. [2022-11-02 21:09:58,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:09:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 12344 transitions. [2022-11-02 21:09:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-02 21:09:58,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:58,919 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 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, 1, 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 21:09:58,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:09:58,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:58,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1358796232, now seen corresponding path program 1 times [2022-11-02 21:09:58,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:58,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162589962] [2022-11-02 21:09:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:09:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:09:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:09:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:09:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:09:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:09:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:09:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:09:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:09:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:09:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:09:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:09:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:09:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:09:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:09:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 21:09:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 21:09:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2022-11-02 21:09:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:59,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162589962] [2022-11-02 21:09:59,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162589962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:59,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:09:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399667114] [2022-11-02 21:09:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:59,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:09:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:09:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:09:59,829 INFO L87 Difference]: Start difference. First operand 8715 states and 12344 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-02 21:10:01,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:03,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:07,408 INFO L93 Difference]: Finished difference Result 20526 states and 30185 transitions. [2022-11-02 21:10:07,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:10:07,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 223 [2022-11-02 21:10:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:07,465 INFO L225 Difference]: With dead ends: 20526 [2022-11-02 21:10:07,465 INFO L226 Difference]: Without dead ends: 11839 [2022-11-02 21:10:07,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:10:07,502 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 1076 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 433 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:07,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 2275 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 609 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-11-02 21:10:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11839 states. [2022-11-02 21:10:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11839 to 8688. [2022-11-02 21:10:08,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8688 states, 6844 states have (on average 1.3933372296902395) internal successors, (9536), 6883 states have internal predecessors, (9536), 1270 states have call successors, (1270), 576 states have call predecessors, (1270), 573 states have return successors, (1374), 1228 states have call predecessors, (1374), 1262 states have call successors, (1374) [2022-11-02 21:10:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8688 states to 8688 states and 12180 transitions. [2022-11-02 21:10:08,394 INFO L78 Accepts]: Start accepts. Automaton has 8688 states and 12180 transitions. Word has length 223 [2022-11-02 21:10:08,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:08,394 INFO L495 AbstractCegarLoop]: Abstraction has 8688 states and 12180 transitions. [2022-11-02 21:10:08,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-02 21:10:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 8688 states and 12180 transitions. [2022-11-02 21:10:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-02 21:10:08,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:08,401 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 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, 1, 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 21:10:08,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:10:08,402 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash -657731654, now seen corresponding path program 1 times [2022-11-02 21:10:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:08,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184878927] [2022-11-02 21:10:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:10:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:10:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:10:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:10:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:10:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:10:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:10:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:10:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:10:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:10:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:10:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:10:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 21:10:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 21:10:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2022-11-02 21:10:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:09,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184878927] [2022-11-02 21:10:09,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184878927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:09,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:09,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:10:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210897711] [2022-11-02 21:10:09,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:09,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:10:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:09,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:10:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:09,440 INFO L87 Difference]: Start difference. First operand 8688 states and 12180 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-02 21:10:11,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:13,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:17,149 INFO L93 Difference]: Finished difference Result 12114 states and 17689 transitions. [2022-11-02 21:10:17,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:10:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 223 [2022-11-02 21:10:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:17,206 INFO L225 Difference]: With dead ends: 12114 [2022-11-02 21:10:17,206 INFO L226 Difference]: Without dead ends: 10865 [2022-11-02 21:10:17,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:10:17,219 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 312 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 204 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:17,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 2649 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 766 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-11-02 21:10:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10865 states. [2022-11-02 21:10:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10865 to 8371. [2022-11-02 21:10:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8371 states, 6565 states have (on average 1.3853769992383853) internal successors, (9095), 6609 states have internal predecessors, (9095), 1226 states have call successors, (1226), 569 states have call predecessors, (1226), 579 states have return successors, (1348), 1192 states have call predecessors, (1348), 1220 states have call successors, (1348) [2022-11-02 21:10:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8371 states to 8371 states and 11669 transitions. [2022-11-02 21:10:18,063 INFO L78 Accepts]: Start accepts. Automaton has 8371 states and 11669 transitions. Word has length 223 [2022-11-02 21:10:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:18,064 INFO L495 AbstractCegarLoop]: Abstraction has 8371 states and 11669 transitions. [2022-11-02 21:10:18,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-02 21:10:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 8371 states and 11669 transitions. [2022-11-02 21:10:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-11-02 21:10:18,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:18,073 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 3, 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, 1, 1, 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 21:10:18,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:10:18,073 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:18,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash 517653439, now seen corresponding path program 1 times [2022-11-02 21:10:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:18,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368125763] [2022-11-02 21:10:18,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:10:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:10:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:10:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:10:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:10:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:10:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:10:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:10:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:10:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:10:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:10:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:10:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-02 21:10:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 21:10:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2022-11-02 21:10:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:19,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368125763] [2022-11-02 21:10:19,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368125763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:19,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:19,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:10:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812759258] [2022-11-02 21:10:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:19,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:10:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:10:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:10:19,142 INFO L87 Difference]: Start difference. First operand 8371 states and 11669 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-02 21:10:21,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:23,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:25,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:27,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:30,522 INFO L93 Difference]: Finished difference Result 11539 states and 16568 transitions. [2022-11-02 21:10:30,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:10:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 233 [2022-11-02 21:10:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:30,554 INFO L225 Difference]: With dead ends: 11539 [2022-11-02 21:10:30,555 INFO L226 Difference]: Without dead ends: 7724 [2022-11-02 21:10:30,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:10:30,568 INFO L413 NwaCegarLoop]: 473 mSDtfsCounter, 612 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 204 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:30,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 2491 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1011 Invalid, 4 Unknown, 0 Unchecked, 10.5s Time] [2022-11-02 21:10:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2022-11-02 21:10:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 5032. [2022-11-02 21:10:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5032 states, 3896 states have (on average 1.3585728952772074) internal successors, (5293), 3916 states have internal predecessors, (5293), 737 states have call successors, (737), 388 states have call predecessors, (737), 398 states have return successors, (805), 727 states have call predecessors, (805), 733 states have call successors, (805) [2022-11-02 21:10:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5032 states to 5032 states and 6835 transitions. [2022-11-02 21:10:31,112 INFO L78 Accepts]: Start accepts. Automaton has 5032 states and 6835 transitions. Word has length 233 [2022-11-02 21:10:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:31,113 INFO L495 AbstractCegarLoop]: Abstraction has 5032 states and 6835 transitions. [2022-11-02 21:10:31,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-11-02 21:10:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 5032 states and 6835 transitions. [2022-11-02 21:10:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-11-02 21:10:31,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:31,121 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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 21:10:31,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:10:31,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 868374850, now seen corresponding path program 1 times [2022-11-02 21:10:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:31,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240703991] [2022-11-02 21:10:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:10:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:10:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:10:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:10:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:10:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:10:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:10:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:10:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:10:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:10:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:10:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:10:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 21:10:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-02 21:10:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 21:10:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-02 21:10:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-02 21:10:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-11-02 21:10:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:32,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240703991] [2022-11-02 21:10:32,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240703991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:32,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:32,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:10:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407691771] [2022-11-02 21:10:32,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:32,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:10:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:10:32,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:32,502 INFO L87 Difference]: Start difference. First operand 5032 states and 6835 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 21:10:34,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:37,044 INFO L93 Difference]: Finished difference Result 9655 states and 13532 transitions. [2022-11-02 21:10:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:10:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 255 [2022-11-02 21:10:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:37,066 INFO L225 Difference]: With dead ends: 9655 [2022-11-02 21:10:37,067 INFO L226 Difference]: Without dead ends: 4651 [2022-11-02 21:10:37,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:10:37,082 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 986 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 487 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:37,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1980 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 591 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-11-02 21:10:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2022-11-02 21:10:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 2861. [2022-11-02 21:10:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2198 states have (on average 1.3475887170154686) internal successors, (2962), 2201 states have internal predecessors, (2962), 428 states have call successors, (428), 236 states have call predecessors, (428), 234 states have return successors, (426), 423 states have call predecessors, (426), 426 states have call successors, (426) [2022-11-02 21:10:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3816 transitions. [2022-11-02 21:10:37,534 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3816 transitions. Word has length 255 [2022-11-02 21:10:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:37,535 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 3816 transitions. [2022-11-02 21:10:37,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 21:10:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3816 transitions. [2022-11-02 21:10:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-02 21:10:37,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:37,546 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:10:37,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:10:37,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:37,548 INFO L85 PathProgramCache]: Analyzing trace with hash -981074928, now seen corresponding path program 1 times [2022-11-02 21:10:37,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:37,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897570280] [2022-11-02 21:10:37,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:37,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:10:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:10:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:10:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:10:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:10:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:10:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:10:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:10:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:10:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:10:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:10:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:10:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 21:10:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 21:10:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-02 21:10:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 21:10:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-02 21:10:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2022-11-02 21:10:38,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897570280] [2022-11-02 21:10:38,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897570280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:38,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:38,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:10:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424380558] [2022-11-02 21:10:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:38,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:10:38,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:10:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:10:38,653 INFO L87 Difference]: Start difference. First operand 2861 states and 3816 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:10:40,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:42,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:44,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:46,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:49,454 INFO L93 Difference]: Finished difference Result 4411 states and 6355 transitions. [2022-11-02 21:10:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:10:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 269 [2022-11-02 21:10:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:49,470 INFO L225 Difference]: With dead ends: 4411 [2022-11-02 21:10:49,470 INFO L226 Difference]: Without dead ends: 4408 [2022-11-02 21:10:49,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:10:49,473 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 710 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 462 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:49,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1779 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 582 Invalid, 4 Unknown, 0 Unchecked, 10.1s Time] [2022-11-02 21:10:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-11-02 21:10:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 2861. [2022-11-02 21:10:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2198 states have (on average 1.3448589626933576) internal successors, (2956), 2201 states have internal predecessors, (2956), 428 states have call successors, (428), 236 states have call predecessors, (428), 234 states have return successors, (426), 423 states have call predecessors, (426), 426 states have call successors, (426) [2022-11-02 21:10:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3810 transitions. [2022-11-02 21:10:49,836 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3810 transitions. Word has length 269 [2022-11-02 21:10:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:49,837 INFO L495 AbstractCegarLoop]: Abstraction has 2861 states and 3810 transitions. [2022-11-02 21:10:49,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (26), 8 states have call predecessors, (26), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:10:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3810 transitions. [2022-11-02 21:10:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-02 21:10:49,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:49,848 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:10:49,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:10:49,849 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:49,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:49,849 INFO L85 PathProgramCache]: Analyzing trace with hash -397996256, now seen corresponding path program 1 times [2022-11-02 21:10:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:49,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024174693] [2022-11-02 21:10:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:10:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:10:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:10:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:10:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 21:10:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:10:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:10:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:10:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:10:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-02 21:10:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:10:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:10:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:50,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:10:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-02 21:10:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-02 21:10:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-11-02 21:10:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-02 21:10:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-02 21:10:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:10:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:10:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:10:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-11-02 21:10:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024174693] [2022-11-02 21:10:51,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024174693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:51,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:51,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 21:10:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251102041] [2022-11-02 21:10:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:51,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:10:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:51,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:10:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:10:51,157 INFO L87 Difference]: Start difference. First operand 2861 states and 3810 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:10:53,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:55,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:57,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:10:59,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:11:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:02,695 INFO L93 Difference]: Finished difference Result 4801 states and 6910 transitions. [2022-11-02 21:11:02,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:11:02,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 275 [2022-11-02 21:11:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:02,697 INFO L225 Difference]: With dead ends: 4801 [2022-11-02 21:11:02,697 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:11:02,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:11:02,709 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 415 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 146 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:02,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 2942 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 985 Invalid, 4 Unknown, 0 Unchecked, 10.7s Time] [2022-11-02 21:11:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:11:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:11:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:11:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:11:02,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2022-11-02 21:11:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:02,711 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:11:02,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (27), 7 states have call predecessors, (27), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:11:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:11:02,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:11:02,714 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:11:02,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:11:02,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.