./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/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_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/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_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/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 0f420ae29f1d217fd86475befc2729bf689978fed36c08e1357ee5c24faa0f48 --- 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:05:12,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:05:12,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:05:12,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:05:12,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:05:12,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:05:12,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:05:12,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:05:12,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:05:12,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:05:12,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:05:12,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:05:12,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:05:12,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:05:12,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:05:12,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:05:12,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:05:12,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:05:12,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:05:12,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:05:12,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:05:12,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:05:12,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:05:12,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:05:12,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:05:12,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:05:12,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:05:12,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:05:12,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:05:12,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:05:12,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:05:12,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:05:12,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:05:12,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:05:12,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:05:12,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:05:12,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:05:12,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:05:12,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:05:12,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:05:12,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:05:12,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:05:12,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:05:12,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:05:12,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:05:12,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:05:12,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:05:12,657 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:05:12,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:05:12,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:05:12,658 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:05:12,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:05:12,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:05:12,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:05:12,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:05:12,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:05:12,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:05:12,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:05:12,661 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:05:12,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:05:12,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:05:12,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:05:12,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:05:12,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:12,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:05:12,662 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:05:12,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:05:12,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:05:12,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:05:12,664 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:05:12,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:05:12,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:05:12,664 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_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/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_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/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 -> 0f420ae29f1d217fd86475befc2729bf689978fed36c08e1357ee5c24faa0f48 [2022-11-02 21:05:12,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:05:13,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:05:13,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:05:13,032 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:05:13,033 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:05:13,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 21:05:13,118 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/data/1efa7d6ca/ccdbe730315945b4bfb8ab4615c8a9be/FLAG6479a95d9 [2022-11-02 21:05:14,066 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:05:14,067 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 21:05:14,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/data/1efa7d6ca/ccdbe730315945b4bfb8ab4615c8a9be/FLAG6479a95d9 [2022-11-02 21:05:14,474 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/data/1efa7d6ca/ccdbe730315945b4bfb8ab4615c8a9be [2022-11-02 21:05:14,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:05:14,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:05:14,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:14,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:05:14,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:05:14,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:14" (1/1) ... [2022-11-02 21:05:14,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254399a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:14, skipping insertion in model container [2022-11-02 21:05:14,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:14" (1/1) ... [2022-11-02 21:05:14,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:05:14,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:05:16,752 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_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i[238753,238766] [2022-11-02 21:05:16,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:16,847 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:05:17,311 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_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i[238753,238766] [2022-11-02 21:05:17,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:17,446 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:05:17,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17 WrapperNode [2022-11-02 21:05:17,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:17,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:17,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:05:17,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:05:17,458 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:05:17" (1/1) ... [2022-11-02 21:05:17,543 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:05:17" (1/1) ... [2022-11-02 21:05:17,859 INFO L138 Inliner]: procedures = 257, calls = 1800, calls flagged for inlining = 103, calls inlined = 99, statements flattened = 4507 [2022-11-02 21:05:17,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:17,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:05:17,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:05:17,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:05:17,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:17,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:17,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:17,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:18,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:18,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:18,275 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:18,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:18,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:05:18,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:05:18,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:05:18,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:05:18,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (1/1) ... [2022-11-02 21:05:18,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:18,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:18,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:05:18,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cdbdcc4a-3ea6-418e-9bc2-fc41ff520946/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:05:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-11-02 21:05:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-11-02 21:05:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 21:05:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 21:05:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:05:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:05:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 21:05:18,433 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 21:05:18,433 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_delete [2022-11-02 21:05:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_delete [2022-11-02 21:05:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_11 [2022-11-02 21:05:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_11 [2022-11-02 21:05:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_wait [2022-11-02 21:05:18,434 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_wait [2022-11-02 21:05:18,434 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_usb_bulk_msg [2022-11-02 21:05:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_usb_bulk_msg [2022-11-02 21:05:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-11-02 21:05:18,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-11-02 21:05:18,435 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-11-02 21:05:18,436 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-11-02 21:05:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:05:18,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:05:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-11-02 21:05:18,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-11-02 21:05:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-11-02 21:05:18,437 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-11-02 21:05:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_signal_sdio_irq [2022-11-02 21:05:18,437 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_signal_sdio_irq [2022-11-02 21:05:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 21:05:18,437 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 21:05:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 21:05:18,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 21:05:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 21:05:18,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 21:05:18,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_49 [2022-11-02 21:05:18,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_49 [2022-11-02 21:05:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:05:18,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:05:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_detect_change [2022-11-02 21:05:18,439 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_detect_change [2022-11-02 21:05:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-02 21:05:18,440 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-02 21:05:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_cancel [2022-11-02 21:05:18,440 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_cancel [2022-11-02 21:05:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 21:05:18,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 21:05:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_init [2022-11-02 21:05:18,441 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_init [2022-11-02 21:05:18,441 INFO L130 BoogieDeclarations]: Found specification of procedure __command_read_data [2022-11-02 21:05:18,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_read_data [2022-11-02 21:05:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_26 [2022-11-02 21:05:18,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_26 [2022-11-02 21:05:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:05:18,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_28 [2022-11-02 21:05:18,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_28 [2022-11-02 21:05:18,443 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-02 21:05:18,443 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-02 21:05:18,444 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-11-02 21:05:18,444 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-11-02 21:05:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:05:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_12 [2022-11-02 21:05:18,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_12 [2022-11-02 21:05:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-02 21:05:18,445 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-02 21:05:18,445 INFO L130 BoogieDeclarations]: Found specification of procedure irqpoll_out_completed [2022-11-02 21:05:18,446 INFO L138 BoogieDeclarations]: Found implementation of procedure irqpoll_out_completed [2022-11-02 21:05:18,446 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_disconnect [2022-11-02 21:05:18,446 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_disconnect [2022-11-02 21:05:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-11-02 21:05:18,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-11-02 21:05:18,447 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_3 [2022-11-02 21:05:18,447 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_3 [2022-11-02 21:05:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:05:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:05:18,448 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-11-02 21:05:18,448 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-11-02 21:05:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 21:05:18,449 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 21:05:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_enable_sdio_irq [2022-11-02 21:05:18,449 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_enable_sdio_irq [2022-11-02 21:05:18,449 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-11-02 21:05:18,449 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-11-02 21:05:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-11-02 21:05:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-11-02 21:05:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure add_offloaded_reg [2022-11-02 21:05:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure add_offloaded_reg [2022-11-02 21:05:18,450 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-11-02 21:05:18,450 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-11-02 21:05:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure command_out_completed [2022-11-02 21:05:18,451 INFO L138 BoogieDeclarations]: Found implementation of procedure command_out_completed [2022-11-02 21:05:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure roundup_to_multiple_of_64 [2022-11-02 21:05:18,452 INFO L138 BoogieDeclarations]: Found implementation of procedure roundup_to_multiple_of_64 [2022-11-02 21:05:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-11-02 21:05:18,452 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-11-02 21:05:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 21:05:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_cmndwork_thread [2022-11-02 21:05:18,453 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_cmndwork_thread [2022-11-02 21:05:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 21:05:18,454 INFO L130 BoogieDeclarations]: Found specification of procedure send_command [2022-11-02 21:05:18,454 INFO L138 BoogieDeclarations]: Found implementation of procedure send_command [2022-11-02 21:05:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-11-02 21:05:18,455 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-11-02 21:05:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:05:18,455 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_6 [2022-11-02 21:05:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_6 [2022-11-02 21:05:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-11-02 21:05:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-11-02 21:05:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 21:05:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 21:05:18,456 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 21:05:18,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 21:05:18,457 INFO L130 BoogieDeclarations]: Found specification of procedure send_irqpoll [2022-11-02 21:05:18,457 INFO L138 BoogieDeclarations]: Found implementation of procedure send_irqpoll [2022-11-02 21:05:18,457 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 21:05:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 21:05:18,458 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 21:05:18,458 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 21:05:18,459 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2022-11-02 21:05:18,459 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2022-11-02 21:05:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:05:18,462 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_response_error [2022-11-02 21:05:18,463 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_response_error [2022-11-02 21:05:18,463 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2022-11-02 21:05:18,464 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2022-11-02 21:05:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_free_host [2022-11-02 21:05:18,465 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_free_host [2022-11-02 21:05:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 21:05:18,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 21:05:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_31 [2022-11-02 21:05:18,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_31 [2022-11-02 21:05:18,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 21:05:18,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 21:05:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:05:18,473 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_6 [2022-11-02 21:05:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_6 [2022-11-02 21:05:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_queue_poll_work [2022-11-02 21:05:18,517 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_queue_poll_work [2022-11-02 21:05:18,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-02 21:05:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-02 21:05:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2022-11-02 21:05:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2022-11-02 21:05:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2022-11-02 21:05:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2022-11-02 21:05:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:05:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure sg_copy_to_buffer [2022-11-02 21:05:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_copy_to_buffer [2022-11-02 21:05:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_6 [2022-11-02 21:05:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_6 [2022-11-02 21:05:18,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put_8 [2022-11-02 21:05:18,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put_8 [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 21:05:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure __download_offload_pseudocode [2022-11-02 21:05:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure __download_offload_pseudocode [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:05:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_pollwork_thread [2022-11-02 21:05:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_pollwork_thread [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_InterfaceNumber [2022-11-02 21:05:18,519 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_InterfaceNumber [2022-11-02 21:05:18,519 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 21:05:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 21:05:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-02 21:05:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-02 21:05:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure __do_poll [2022-11-02 21:05:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_poll [2022-11-02 21:05:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_3 [2022-11-02 21:05:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_3 [2022-11-02 21:05:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure new_system_port_status [2022-11-02 21:05:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure new_system_port_status [2022-11-02 21:05:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_request_done [2022-11-02 21:05:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_request_done [2022-11-02 21:05:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-11-02 21:05:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-11-02 21:05:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-11-02 21:05:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-11-02 21:05:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure __command_write_data [2022-11-02 21:05:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_write_data [2022-11-02 21:05:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-11-02 21:05:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-11-02 21:05:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-02 21:05:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-02 21:05:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_46 [2022-11-02 21:05:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_46 [2022-11-02 21:05:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-02 21:05:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-02 21:05:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:05:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-11-02 21:05:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-11-02 21:05:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_priv [2022-11-02 21:05:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_priv [2022-11-02 21:05:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-11-02 21:05:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-11-02 21:05:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_deadwork_thread [2022-11-02 21:05:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_deadwork_thread [2022-11-02 21:05:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure check_vub300_port_status [2022-11-02 21:05:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure check_vub300_port_status [2022-11-02 21:05:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-02 21:05:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:05:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:05:19,240 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:05:19,243 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:05:21,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:05:26,183 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:26,200 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:26,200 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:05:26,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:26 BoogieIcfgContainer [2022-11-02 21:05:26,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:26,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:26,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:26,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:26,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:05:14" (1/3) ... [2022-11-02 21:05:26,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fa2bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:26, skipping insertion in model container [2022-11-02 21:05:26,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:17" (2/3) ... [2022-11-02 21:05:26,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72fa2bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:26, skipping insertion in model container [2022-11-02 21:05:26,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:26" (3/3) ... [2022-11-02 21:05:26,219 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 21:05:26,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:26,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:05:26,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:26,346 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;@61343df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:26,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:05:26,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 1578 states, 1108 states have (on average 1.3998194945848375) internal successors, (1551), 1173 states have internal predecessors, (1551), 377 states have call successors, (377), 92 states have call predecessors, (377), 91 states have return successors, (368), 342 states have call predecessors, (368), 368 states have call successors, (368) [2022-11-02 21:05:26,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 21:05:26,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:26,400 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 21:05:26,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -695991338, now seen corresponding path program 1 times [2022-11-02 21:05:26,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:26,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401430380] [2022-11-02 21:05:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:05:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:05:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:05:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:05:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:05:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 21:05:27,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401430380] [2022-11-02 21:05:27,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401430380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:27,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:27,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:27,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233571573] [2022-11-02 21:05:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:27,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:27,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:27,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:27,444 INFO L87 Difference]: Start difference. First operand has 1578 states, 1108 states have (on average 1.3998194945848375) internal successors, (1551), 1173 states have internal predecessors, (1551), 377 states have call successors, (377), 92 states have call predecessors, (377), 91 states have return successors, (368), 342 states have call predecessors, (368), 368 states have call successors, (368) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:05:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:42,104 INFO L93 Difference]: Finished difference Result 3309 states and 4923 transitions. [2022-11-02 21:05:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:05:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-11-02 21:05:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:42,164 INFO L225 Difference]: With dead ends: 3309 [2022-11-02 21:05:42,168 INFO L226 Difference]: Without dead ends: 1720 [2022-11-02 21:05:42,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 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:05:42,199 INFO L413 NwaCegarLoop]: 2111 mSDtfsCounter, 1088 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 964 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 4405 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 964 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:42,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 4405 Invalid, 3244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [964 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2022-11-02 21:05:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2022-11-02 21:05:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1562. [2022-11-02 21:05:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1103 states have (on average 1.3907524932003625) internal successors, (1534), 1157 states have internal predecessors, (1534), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) [2022-11-02 21:05:42,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2265 transitions. [2022-11-02 21:05:42,408 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2265 transitions. Word has length 114 [2022-11-02 21:05:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:42,409 INFO L495 AbstractCegarLoop]: Abstraction has 1562 states and 2265 transitions. [2022-11-02 21:05:42,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:05:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2265 transitions. [2022-11-02 21:05:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 21:05:42,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:42,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 21:05:42,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:05:42,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:42,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1398740446, now seen corresponding path program 1 times [2022-11-02 21:05:42,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679554502] [2022-11-02 21:05:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:42,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:43,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:05:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:05:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:05:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:05:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:05:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:05:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 21:05:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:43,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679554502] [2022-11-02 21:05:43,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679554502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:43,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:43,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993342215] [2022-11-02 21:05:43,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:43,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:43,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:43,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:43,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:43,570 INFO L87 Difference]: Start difference. First operand 1562 states and 2265 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, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:05:56,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:00,347 INFO L93 Difference]: Finished difference Result 4952 states and 7650 transitions. [2022-11-02 21:06:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:06:00,348 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, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-11-02 21:06:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:00,375 INFO L225 Difference]: With dead ends: 4952 [2022-11-02 21:06:00,376 INFO L226 Difference]: Without dead ends: 3413 [2022-11-02 21:06:00,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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:06:00,389 INFO L413 NwaCegarLoop]: 2653 mSDtfsCounter, 4276 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 2261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4479 SdHoareTripleChecker+Valid, 6045 SdHoareTripleChecker+Invalid, 5627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2261 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:00,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4479 Valid, 6045 Invalid, 5627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2261 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2022-11-02 21:06:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2022-11-02 21:06:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3183. [2022-11-02 21:06:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3183 states, 2243 states have (on average 1.384306732055283) internal successors, (3105), 2358 states have internal predecessors, (3105), 735 states have call successors, (735), 180 states have call predecessors, (735), 204 states have return successors, (939), 697 states have call predecessors, (939), 730 states have call successors, (939) [2022-11-02 21:06:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3183 states to 3183 states and 4779 transitions. [2022-11-02 21:06:00,665 INFO L78 Accepts]: Start accepts. Automaton has 3183 states and 4779 transitions. Word has length 114 [2022-11-02 21:06:00,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:00,669 INFO L495 AbstractCegarLoop]: Abstraction has 3183 states and 4779 transitions. [2022-11-02 21:06:00,673 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, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3183 states and 4779 transitions. [2022-11-02 21:06:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 21:06:00,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:00,678 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 21:06:00,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:06:00,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 410740249, now seen corresponding path program 1 times [2022-11-02 21:06:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:00,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937900034] [2022-11-02 21:06:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:06:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:06:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:06:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:06:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 21:06:01,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:01,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937900034] [2022-11-02 21:06:01,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937900034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:01,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:01,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269047024] [2022-11-02 21:06:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:01,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:01,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:01,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:01,352 INFO L87 Difference]: Start difference. First operand 3183 states and 4779 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:10,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:11,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:16,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:21,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:22,165 INFO L93 Difference]: Finished difference Result 9935 states and 15966 transitions. [2022-11-02 21:06:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:06:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2022-11-02 21:06:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:22,218 INFO L225 Difference]: With dead ends: 9935 [2022-11-02 21:06:22,218 INFO L226 Difference]: Without dead ends: 6775 [2022-11-02 21:06:22,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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:06:22,251 INFO L413 NwaCegarLoop]: 2691 mSDtfsCounter, 4230 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 3386 mSolverCounterSat, 2242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4442 SdHoareTripleChecker+Valid, 6049 SdHoareTripleChecker+Invalid, 5628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2242 IncrementalHoareTripleChecker+Valid, 3386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:22,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4442 Valid, 6049 Invalid, 5628 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2242 Valid, 3386 Invalid, 0 Unknown, 0 Unchecked, 20.1s Time] [2022-11-02 21:06:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6775 states. [2022-11-02 21:06:22,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6775 to 6358. [2022-11-02 21:06:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6358 states, 4480 states have (on average 1.3830357142857144) internal successors, (6196), 4713 states have internal predecessors, (6196), 1463 states have call successors, (1463), 358 states have call predecessors, (1463), 414 states have return successors, (2241), 1395 states have call predecessors, (2241), 1458 states have call successors, (2241) [2022-11-02 21:06:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 9900 transitions. [2022-11-02 21:06:22,651 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 9900 transitions. Word has length 115 [2022-11-02 21:06:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:22,651 INFO L495 AbstractCegarLoop]: Abstraction has 6358 states and 9900 transitions. [2022-11-02 21:06:22,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 9900 transitions. [2022-11-02 21:06:22,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 21:06:22,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:22,657 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 21:06:22,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:06:22,658 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:22,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash -152489919, now seen corresponding path program 1 times [2022-11-02 21:06:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:22,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130184453] [2022-11-02 21:06:22,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:06:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:06:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:22,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:06:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:23,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:23,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:06:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 21:06:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:23,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130184453] [2022-11-02 21:06:23,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130184453] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:23,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:23,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780044911] [2022-11-02 21:06:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:23,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:23,030 INFO L87 Difference]: Start difference. First operand 6358 states and 9900 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:32,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:35,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:40,922 INFO L93 Difference]: Finished difference Result 6773 states and 10669 transitions. [2022-11-02 21:06:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:06:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 116 [2022-11-02 21:06:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:40,969 INFO L225 Difference]: With dead ends: 6773 [2022-11-02 21:06:40,970 INFO L226 Difference]: Without dead ends: 6770 [2022-11-02 21:06:40,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 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:06:40,975 INFO L413 NwaCegarLoop]: 2693 mSDtfsCounter, 4098 mSDsluCounter, 4320 mSDsCounter, 0 mSdLazyCounter, 4398 mSolverCounterSat, 2130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4310 SdHoareTripleChecker+Valid, 7013 SdHoareTripleChecker+Invalid, 6528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2130 IncrementalHoareTripleChecker+Valid, 4398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:40,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4310 Valid, 7013 Invalid, 6528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2130 Valid, 4398 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2022-11-02 21:06:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6770 states. [2022-11-02 21:06:41,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6770 to 6359. [2022-11-02 21:06:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6359 states, 4481 states have (on average 1.3829502343226958) internal successors, (6197), 4714 states have internal predecessors, (6197), 1463 states have call successors, (1463), 358 states have call predecessors, (1463), 414 states have return successors, (2241), 1395 states have call predecessors, (2241), 1458 states have call successors, (2241) [2022-11-02 21:06:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 9901 transitions. [2022-11-02 21:06:41,459 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 9901 transitions. Word has length 116 [2022-11-02 21:06:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:41,459 INFO L495 AbstractCegarLoop]: Abstraction has 6359 states and 9901 transitions. [2022-11-02 21:06:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 9901 transitions. [2022-11-02 21:06:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 21:06:41,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:41,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 21:06:41,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:06:41,464 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:41,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:41,465 INFO L85 PathProgramCache]: Analyzing trace with hash -432751076, now seen corresponding path program 1 times [2022-11-02 21:06:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:41,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840178479] [2022-11-02 21:06:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:41,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:06:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:06:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:06:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:06:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 21:06:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:41,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840178479] [2022-11-02 21:06:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840178479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:41,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:41,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054297615] [2022-11-02 21:06:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:41,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:41,777 INFO L87 Difference]: Start difference. First operand 6359 states and 9901 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:47,732 INFO L93 Difference]: Finished difference Result 6769 states and 10665 transitions. [2022-11-02 21:06:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:06:47,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 117 [2022-11-02 21:06:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:47,788 INFO L225 Difference]: With dead ends: 6769 [2022-11-02 21:06:47,788 INFO L226 Difference]: Without dead ends: 6766 [2022-11-02 21:06:47,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:06:47,794 INFO L413 NwaCegarLoop]: 2060 mSDtfsCounter, 3576 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 1775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3784 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1775 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:47,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3784 Valid, 2889 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1775 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-02 21:06:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6766 states. [2022-11-02 21:06:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6766 to 6358. [2022-11-02 21:06:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6358 states, 4481 states have (on average 1.3827270698504799) internal successors, (6196), 4713 states have internal predecessors, (6196), 1462 states have call successors, (1462), 358 states have call predecessors, (1462), 414 states have return successors, (2241), 1395 states have call predecessors, (2241), 1458 states have call successors, (2241) [2022-11-02 21:06:48,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6358 states to 6358 states and 9899 transitions. [2022-11-02 21:06:48,220 INFO L78 Accepts]: Start accepts. Automaton has 6358 states and 9899 transitions. Word has length 117 [2022-11-02 21:06:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:48,221 INFO L495 AbstractCegarLoop]: Abstraction has 6358 states and 9899 transitions. [2022-11-02 21:06:48,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6358 states and 9899 transitions. [2022-11-02 21:06:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-02 21:06:48,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:48,225 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-02 21:06:48,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:06:48,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -530907484, now seen corresponding path program 1 times [2022-11-02 21:06:48,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:48,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936228382] [2022-11-02 21:06:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:06:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:06:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:06:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:06:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:06:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:48,635 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-02 21:06:48,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:48,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936228382] [2022-11-02 21:06:48,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936228382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:48,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:48,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184731705] [2022-11-02 21:06:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:48,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:48,637 INFO L87 Difference]: Start difference. First operand 6358 states and 9899 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:06:56,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:03,266 INFO L93 Difference]: Finished difference Result 6768 states and 10663 transitions. [2022-11-02 21:07:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:07:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2022-11-02 21:07:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:03,308 INFO L225 Difference]: With dead ends: 6768 [2022-11-02 21:07:03,308 INFO L226 Difference]: Without dead ends: 6735 [2022-11-02 21:07:03,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:03,317 INFO L413 NwaCegarLoop]: 2057 mSDtfsCounter, 3002 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 1259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3208 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 3578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1259 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:03,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3208 Valid, 4312 Invalid, 3578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1259 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2022-11-02 21:07:03,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6735 states. [2022-11-02 21:07:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6735 to 6327. [2022-11-02 21:07:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6327 states, 4464 states have (on average 1.38328853046595) internal successors, (6175), 4695 states have internal predecessors, (6175), 1449 states have call successors, (1449), 357 states have call predecessors, (1449), 413 states have return successors, (2205), 1383 states have call predecessors, (2205), 1446 states have call successors, (2205) [2022-11-02 21:07:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6327 states to 6327 states and 9829 transitions. [2022-11-02 21:07:03,766 INFO L78 Accepts]: Start accepts. Automaton has 6327 states and 9829 transitions. Word has length 118 [2022-11-02 21:07:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:03,767 INFO L495 AbstractCegarLoop]: Abstraction has 6327 states and 9829 transitions. [2022-11-02 21:07:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:07:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6327 states and 9829 transitions. [2022-11-02 21:07:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-11-02 21:07:03,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:03,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:03,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:03,786 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1173826115, now seen corresponding path program 1 times [2022-11-02 21:07:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:03,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154105936] [2022-11-02 21:07:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:07:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:07:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:07:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:07:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:07:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:07:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 21:07:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 21:07:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:07:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:07:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 21:07:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:07:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-02 21:07:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:04,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154105936] [2022-11-02 21:07:04,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154105936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:04,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:04,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:07:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236432282] [2022-11-02 21:07:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:07:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:07:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:04,286 INFO L87 Difference]: Start difference. First operand 6327 states and 9829 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:07:16,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:17,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:26,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:28,336 INFO L93 Difference]: Finished difference Result 19759 states and 31109 transitions. [2022-11-02 21:07:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:07:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 180 [2022-11-02 21:07:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:28,422 INFO L225 Difference]: With dead ends: 19759 [2022-11-02 21:07:28,422 INFO L226 Difference]: Without dead ends: 13455 [2022-11-02 21:07:28,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:28,468 INFO L413 NwaCegarLoop]: 2263 mSDtfsCounter, 6375 mSDsluCounter, 3680 mSDsCounter, 0 mSdLazyCounter, 5167 mSolverCounterSat, 4893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6691 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 10060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4893 IncrementalHoareTripleChecker+Valid, 5167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:28,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6691 Valid, 5943 Invalid, 10060 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4893 Valid, 5167 Invalid, 0 Unknown, 0 Unchecked, 22.7s Time] [2022-11-02 21:07:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13455 states. [2022-11-02 21:07:29,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13455 to 12400. [2022-11-02 21:07:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12400 states, 8669 states have (on average 1.3753604798708041) internal successors, (11923), 9155 states have internal predecessors, (11923), 2778 states have call successors, (2778), 677 states have call predecessors, (2778), 952 states have return successors, (4680), 2835 states have call predecessors, (4680), 2775 states have call successors, (4680) [2022-11-02 21:07:29,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12400 states to 12400 states and 19381 transitions. [2022-11-02 21:07:29,521 INFO L78 Accepts]: Start accepts. Automaton has 12400 states and 19381 transitions. Word has length 180 [2022-11-02 21:07:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:29,522 INFO L495 AbstractCegarLoop]: Abstraction has 12400 states and 19381 transitions. [2022-11-02 21:07:29,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (18), 7 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:07:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 12400 states and 19381 transitions. [2022-11-02 21:07:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-02 21:07:29,558 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:29,558 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:29,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 347877174, now seen corresponding path program 1 times [2022-11-02 21:07:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:29,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059235998] [2022-11-02 21:07:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:29,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:07:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:07:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:07:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:07:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:07:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:07:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 21:07:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 21:07:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-02 21:07:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-02 21:07:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 21:07:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 21:07:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:07:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2022-11-02 21:07:30,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:30,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059235998] [2022-11-02 21:07:30,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059235998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:30,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:30,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:07:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3013535] [2022-11-02 21:07:30,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:07:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:07:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:30,332 INFO L87 Difference]: Start difference. First operand 12400 states and 19381 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:07:39,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:45,233 INFO L93 Difference]: Finished difference Result 28465 states and 45439 transitions. [2022-11-02 21:07:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:07:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 219 [2022-11-02 21:07:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:45,381 INFO L225 Difference]: With dead ends: 28465 [2022-11-02 21:07:45,381 INFO L226 Difference]: Without dead ends: 16088 [2022-11-02 21:07:45,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:07:45,446 INFO L413 NwaCegarLoop]: 2334 mSDtfsCounter, 5280 mSDsluCounter, 3489 mSDsCounter, 0 mSdLazyCounter, 3201 mSolverCounterSat, 3656 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5563 SdHoareTripleChecker+Valid, 5823 SdHoareTripleChecker+Invalid, 6857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3656 IncrementalHoareTripleChecker+Valid, 3201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:45,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5563 Valid, 5823 Invalid, 6857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3656 Valid, 3201 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2022-11-02 21:07:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2022-11-02 21:07:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 12414. [2022-11-02 21:07:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12414 states, 8683 states have (on average 1.3747552689162732) internal successors, (11937), 9169 states have internal predecessors, (11937), 2778 states have call successors, (2778), 677 states have call predecessors, (2778), 952 states have return successors, (4680), 2835 states have call predecessors, (4680), 2775 states have call successors, (4680) [2022-11-02 21:07:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12414 states to 12414 states and 19395 transitions. [2022-11-02 21:07:46,881 INFO L78 Accepts]: Start accepts. Automaton has 12414 states and 19395 transitions. Word has length 219 [2022-11-02 21:07:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:46,882 INFO L495 AbstractCegarLoop]: Abstraction has 12414 states and 19395 transitions. [2022-11-02 21:07:46,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:07:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12414 states and 19395 transitions. [2022-11-02 21:07:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-11-02 21:07:46,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:46,921 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:07:46,921 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash -2061198310, now seen corresponding path program 1 times [2022-11-02 21:07:46,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:46,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133361504] [2022-11-02 21:07:46,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:07:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:07:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:07:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:07:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:07:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:07:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 21:07:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:07:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:07:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 21:07:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 21:07:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-02 21:07:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 21:07:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 21:07:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:07:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-11-02 21:07:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:47,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133361504] [2022-11-02 21:07:47,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133361504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:47,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:47,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:07:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215055144] [2022-11-02 21:07:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:47,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:07:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:07:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:07:47,577 INFO L87 Difference]: Start difference. First operand 12414 states and 19395 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 21:07:59,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:08,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:10,436 INFO L93 Difference]: Finished difference Result 38754 states and 61038 transitions. [2022-11-02 21:08:10,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:08:10,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 236 [2022-11-02 21:08:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:10,626 INFO L225 Difference]: With dead ends: 38754 [2022-11-02 21:08:10,626 INFO L226 Difference]: Without dead ends: 26324 [2022-11-02 21:08:10,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:08:10,695 INFO L413 NwaCegarLoop]: 3480 mSDtfsCounter, 4726 mSDsluCounter, 5012 mSDsCounter, 0 mSdLazyCounter, 4789 mSolverCounterSat, 3779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5074 SdHoareTripleChecker+Valid, 8492 SdHoareTripleChecker+Invalid, 8568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3779 IncrementalHoareTripleChecker+Valid, 4789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:10,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5074 Valid, 8492 Invalid, 8568 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3779 Valid, 4789 Invalid, 0 Unknown, 0 Unchecked, 20.1s Time] [2022-11-02 21:08:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26324 states. [2022-11-02 21:08:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26324 to 24277. [2022-11-02 21:08:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24277 states, 17015 states have (on average 1.375550984425507) internal successors, (23405), 17953 states have internal predecessors, (23405), 5394 states have call successors, (5394), 1328 states have call predecessors, (5394), 1867 states have return successors, (9045), 5493 states have call predecessors, (9045), 5391 states have call successors, (9045) [2022-11-02 21:08:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24277 states to 24277 states and 37844 transitions. [2022-11-02 21:08:13,135 INFO L78 Accepts]: Start accepts. Automaton has 24277 states and 37844 transitions. Word has length 236 [2022-11-02 21:08:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:13,140 INFO L495 AbstractCegarLoop]: Abstraction has 24277 states and 37844 transitions. [2022-11-02 21:08:13,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 3 states have internal predecessors, (112), 3 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 21:08:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 24277 states and 37844 transitions. [2022-11-02 21:08:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-11-02 21:08:13,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:13,246 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:13,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:08:13,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash -744424122, now seen corresponding path program 1 times [2022-11-02 21:08:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537554660] [2022-11-02 21:08:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:08:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:08:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:08:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:08:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:08:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:08:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:13,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:08:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-02 21:08:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-02 21:08:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:08:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 21:08:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-02 21:08:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 21:08:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 21:08:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 21:08:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-02 21:08:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-02 21:08:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-02 21:08:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-11-02 21:08:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:14,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537554660] [2022-11-02 21:08:14,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537554660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:14,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:14,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:08:14,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425335403] [2022-11-02 21:08:14,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:14,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:08:14,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:14,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:08:14,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:08:14,277 INFO L87 Difference]: Start difference. First operand 24277 states and 37844 transitions. Second operand has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (25), 8 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 21:08:17,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:23,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:29,929 INFO L93 Difference]: Finished difference Result 40772 states and 63558 transitions. [2022-11-02 21:08:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:08:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (25), 8 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 262 [2022-11-02 21:08:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:30,030 INFO L225 Difference]: With dead ends: 40772 [2022-11-02 21:08:30,031 INFO L226 Difference]: Without dead ends: 16526 [2022-11-02 21:08:30,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:08:30,139 INFO L413 NwaCegarLoop]: 1979 mSDtfsCounter, 3035 mSDsluCounter, 3353 mSDsCounter, 0 mSdLazyCounter, 3497 mSolverCounterSat, 2777 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3117 SdHoareTripleChecker+Valid, 5332 SdHoareTripleChecker+Invalid, 6274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2777 IncrementalHoareTripleChecker+Valid, 3497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:30,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3117 Valid, 5332 Invalid, 6274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2777 Valid, 3497 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2022-11-02 21:08:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2022-11-02 21:08:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 15060. [2022-11-02 21:08:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15060 states, 10533 states have (on average 1.371973796639134) internal successors, (14451), 11112 states have internal predecessors, (14451), 3355 states have call successors, (3355), 854 states have call predecessors, (3355), 1171 states have return successors, (5333), 3400 states have call predecessors, (5333), 3352 states have call successors, (5333) [2022-11-02 21:08:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15060 states to 15060 states and 23139 transitions. [2022-11-02 21:08:32,598 INFO L78 Accepts]: Start accepts. Automaton has 15060 states and 23139 transitions. Word has length 262 [2022-11-02 21:08:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:32,599 INFO L495 AbstractCegarLoop]: Abstraction has 15060 states and 23139 transitions. [2022-11-02 21:08:32,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.88888888888889) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (25), 8 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 21:08:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 15060 states and 23139 transitions. [2022-11-02 21:08:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2022-11-02 21:08:32,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:32,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:32,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:08:32,663 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:32,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:32,664 INFO L85 PathProgramCache]: Analyzing trace with hash 656443316, now seen corresponding path program 1 times [2022-11-02 21:08:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:32,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005733824] [2022-11-02 21:08:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:08:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 21:08:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:08:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:08:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 21:08:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:08:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:08:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 21:08:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:08:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 21:08:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 21:08:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 21:08:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 21:08:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:08:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:08:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 21:08:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-02 21:08:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:08:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-11-02 21:08:35,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:35,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005733824] [2022-11-02 21:08:35,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005733824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:35,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:35,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 21:08:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688388423] [2022-11-02 21:08:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:35,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 21:08:35,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 21:08:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:08:35,888 INFO L87 Difference]: Start difference. First operand 15060 states and 23139 transitions. Second operand has 14 states, 14 states have (on average 11.285714285714286) internal successors, (158), 4 states have internal predecessors, (158), 3 states have call successors, (33), 11 states have call predecessors, (33), 3 states have return successors, (32), 4 states have call predecessors, (32), 3 states have call successors, (32)