./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/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 6150b3a515973ce4119efed812e463608b94129eea9915abf4784f091ce6f187 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:31:53,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:31:53,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:31:53,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:31:53,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:31:53,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:31:53,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:31:53,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:31:53,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:31:53,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:31:53,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:31:53,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:31:53,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:31:53,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:31:53,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:31:53,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:31:53,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:31:53,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:31:53,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:31:53,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:31:53,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:31:53,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:31:53,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:31:53,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:31:53,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:31:53,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:31:53,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:31:53,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:31:53,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:31:53,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:31:53,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:31:53,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:31:53,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:31:53,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:31:53,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:31:53,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:31:53,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:31:53,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:31:53,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:31:53,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:31:53,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:31:53,171 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:31:53,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:31:53,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:31:53,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:31:53,210 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:31:53,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:31:53,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:31:53,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:31:53,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:31:53,212 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:31:53,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:31:53,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:31:53,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:31:53,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:31:53,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:31:53,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:31:53,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:31:53,214 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:31:53,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:31:53,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:31:53,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:31:53,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:31:53,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:31:53,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:31:53,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:31:53,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:31:53,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:31:53,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:31:53,218 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:31:53,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:31:53,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:31:53,219 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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/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 -> 6150b3a515973ce4119efed812e463608b94129eea9915abf4784f091ce6f187 [2022-11-02 20:31:53,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:31:53,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:31:53,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:31:53,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:31:53,533 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:31:53,534 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:31:53,605 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/data/73bc74503/7b963ba938154abab0c34fe3b5440544/FLAG443b937fc [2022-11-02 20:31:54,326 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:31:54,327 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:31:54,374 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/data/73bc74503/7b963ba938154abab0c34fe3b5440544/FLAG443b937fc [2022-11-02 20:31:54,420 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/data/73bc74503/7b963ba938154abab0c34fe3b5440544 [2022-11-02 20:31:54,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:31:54,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:31:54,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:31:54,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:31:54,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:31:54,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:31:54" (1/1) ... [2022-11-02 20:31:54,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@125153d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:54, skipping insertion in model container [2022-11-02 20:31:54,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:31:54" (1/1) ... [2022-11-02 20:31:54,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:31:54,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:31:56,416 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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i[238462,238475] [2022-11-02 20:31:56,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:31:56,485 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:31:56,903 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_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i[238462,238475] [2022-11-02 20:31:56,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:31:57,033 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:31:57,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57 WrapperNode [2022-11-02 20:31:57,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:31:57,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:31:57,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:31:57,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:31:57,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,394 INFO L138 Inliner]: procedures = 258, calls = 1803, calls flagged for inlining = 103, calls inlined = 99, statements flattened = 4499 [2022-11-02 20:31:57,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:31:57,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:31:57,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:31:57,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:31:57,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,744 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:31:57,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:31:57,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:31:57,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:31:57,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (1/1) ... [2022-11-02 20:31:57,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:31:57,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:31:57,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:31:57,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46c3e160-7f3f-4f62-afc5-e8a5f00c0490/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:31:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-11-02 20:31:57,972 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-11-02 20:31:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_12 [2022-11-02 20:31:57,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_12 [2022-11-02 20:31:57,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:31:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:31:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:31:57,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:31:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 20:31:57,973 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 20:31:57,973 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_delete [2022-11-02 20:31:57,973 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_delete [2022-11-02 20:31:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_wait [2022-11-02 20:31:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_wait [2022-11-02 20:31:57,974 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_usb_bulk_msg [2022-11-02 20:31:57,974 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_usb_bulk_msg [2022-11-02 20:31:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-11-02 20:31:57,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-11-02 20:31:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-11-02 20:31:57,975 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-11-02 20:31:57,975 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:31:57,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:31:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-11-02 20:31:57,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-11-02 20:31:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-11-02 20:31:57,976 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-11-02 20:31:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_signal_sdio_irq [2022-11-02 20:31:57,976 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_signal_sdio_irq [2022-11-02 20:31:57,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_50 [2022-11-02 20:31:57,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_50 [2022-11-02 20:31:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 20:31:57,977 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 20:31:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:31:57,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:31:57,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 20:31:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 20:31:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:31:57,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:31:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_detect_change [2022-11-02 20:31:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_detect_change [2022-11-02 20:31:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-02 20:31:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-02 20:31:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_cancel [2022-11-02 20:31:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_cancel [2022-11-02 20:31:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 20:31:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-11-02 20:31:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_init [2022-11-02 20:31:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_init [2022-11-02 20:31:57,980 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_29 [2022-11-02 20:31:57,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_29 [2022-11-02 20:31:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure __command_read_data [2022-11-02 20:31:57,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_read_data [2022-11-02 20:31:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:31:57,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_27 [2022-11-02 20:31:57,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_27 [2022-11-02 20:31:57,982 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-02 20:31:57,982 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-02 20:31:57,983 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-11-02 20:31:57,983 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-11-02 20:31:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:31:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_13 [2022-11-02 20:31:57,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_13 [2022-11-02 20:31:57,984 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-02 20:31:57,985 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-02 20:31:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure irqpoll_out_completed [2022-11-02 20:31:57,985 INFO L138 BoogieDeclarations]: Found implementation of procedure irqpoll_out_completed [2022-11-02 20:31:57,985 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_disconnect [2022-11-02 20:31:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_disconnect [2022-11-02 20:31:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_3 [2022-11-02 20:31:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_3 [2022-11-02 20:31:57,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_15 [2022-11-02 20:31:57,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_15 [2022-11-02 20:31:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:31:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:31:57,987 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-11-02 20:31:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-11-02 20:31:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 20:31:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 20:31:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_enable_sdio_irq [2022-11-02 20:31:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_enable_sdio_irq [2022-11-02 20:31:57,988 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-11-02 20:31:57,988 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-11-02 20:31:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-11-02 20:31:57,989 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-11-02 20:31:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure add_offloaded_reg [2022-11-02 20:31:57,989 INFO L138 BoogieDeclarations]: Found implementation of procedure add_offloaded_reg [2022-11-02 20:31:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-11-02 20:31:57,989 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-11-02 20:31:57,989 INFO L130 BoogieDeclarations]: Found specification of procedure command_out_completed [2022-11-02 20:31:57,990 INFO L138 BoogieDeclarations]: Found implementation of procedure command_out_completed [2022-11-02 20:31:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure roundup_to_multiple_of_64 [2022-11-02 20:31:57,990 INFO L138 BoogieDeclarations]: Found implementation of procedure roundup_to_multiple_of_64 [2022-11-02 20:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-11-02 20:31:57,991 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-11-02 20:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_cmndwork_thread [2022-11-02 20:31:57,992 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_cmndwork_thread [2022-11-02 20:31:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:31:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_4 [2022-11-02 20:31:57,993 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_4 [2022-11-02 20:31:57,993 INFO L130 BoogieDeclarations]: Found specification of procedure send_command [2022-11-02 20:31:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure send_command [2022-11-02 20:31:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-11-02 20:31:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-11-02 20:31:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:31:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-11-02 20:31:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-11-02 20:31:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:31:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:31:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 20:31:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 20:31:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure send_irqpoll [2022-11-02 20:31:57,996 INFO L138 BoogieDeclarations]: Found implementation of procedure send_irqpoll [2022-11-02 20:31:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 20:31:57,996 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 20:31:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:31:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:31:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2022-11-02 20:31:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2022-11-02 20:31:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:31:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_response_error [2022-11-02 20:31:58,001 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_response_error [2022-11-02 20:31:58,002 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2022-11-02 20:31:58,002 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2022-11-02 20:31:58,004 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_free_host [2022-11-02 20:31:58,005 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_free_host [2022-11-02 20:31:58,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:31:58,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:31:58,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_32 [2022-11-02 20:31:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_32 [2022-11-02 20:31:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-02 20:31:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-02 20:31:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:31:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_queue_poll_work [2022-11-02 20:31:58,011 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_queue_poll_work [2022-11-02 20:31:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_4 [2022-11-02 20:31:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_4 [2022-11-02 20:31:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-11-02 20:31:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-11-02 20:31:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2022-11-02 20:31:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2022-11-02 20:31:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2022-11-02 20:31:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2022-11-02 20:31:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:31:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure sg_copy_to_buffer [2022-11-02 20:31:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_copy_to_buffer [2022-11-02 20:31:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put_9 [2022-11-02 20:31:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put_9 [2022-11-02 20:31:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:31:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:31:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:31:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure __download_offload_pseudocode [2022-11-02 20:31:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __download_offload_pseudocode [2022-11-02 20:31:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:31:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:31:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_4 [2022-11-02 20:31:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_4 [2022-11-02 20:31:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_pollwork_thread [2022-11-02 20:31:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_pollwork_thread [2022-11-02 20:31:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_InterfaceNumber [2022-11-02 20:31:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_InterfaceNumber [2022-11-02 20:31:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 20:31:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 20:31:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-02 20:31:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-02 20:31:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure __do_poll [2022-11-02 20:31:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_poll [2022-11-02 20:31:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_3 [2022-11-02 20:31:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_3 [2022-11-02 20:31:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure new_system_port_status [2022-11-02 20:31:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure new_system_port_status [2022-11-02 20:31:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_request_done [2022-11-02 20:31:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_request_done [2022-11-02 20:31:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-11-02 20:31:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-11-02 20:31:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-11-02 20:31:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-11-02 20:31:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure __command_write_data [2022-11-02 20:31:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_write_data [2022-11-02 20:31:58,017 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-11-02 20:31:58,017 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-11-02 20:31:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-11-02 20:31:58,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-11-02 20:31:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure delayed_work_timer_fn [2022-11-02 20:31:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_47 [2022-11-02 20:31:58,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_47 [2022-11-02 20:31:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-02 20:31:58,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-02 20:31:58,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:31:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-11-02 20:31:58,019 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-11-02 20:31:58,019 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_priv [2022-11-02 20:31:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_priv [2022-11-02 20:31:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-11-02 20:31:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-11-02 20:31:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_deadwork_thread [2022-11-02 20:31:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_deadwork_thread [2022-11-02 20:31:58,021 INFO L130 BoogieDeclarations]: Found specification of procedure check_vub300_port_status [2022-11-02 20:31:58,021 INFO L138 BoogieDeclarations]: Found implementation of procedure check_vub300_port_status [2022-11-02 20:31:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-02 20:31:58,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:31:58,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:31:58,785 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:31:58,788 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:32:00,520 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:32:05,502 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:32:05,528 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:32:05,528 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:32:05,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:05 BoogieIcfgContainer [2022-11-02 20:32:05,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:32:05,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:32:05,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:32:05,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:32:05,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:31:54" (1/3) ... [2022-11-02 20:32:05,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a8e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:05, skipping insertion in model container [2022-11-02 20:32:05,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:31:57" (2/3) ... [2022-11-02 20:32:05,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782a8e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:32:05, skipping insertion in model container [2022-11-02 20:32:05,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:32:05" (3/3) ... [2022-11-02 20:32:05,542 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-063f96c-1-144_2a-drivers--mmc--host--vub300.ko.unsigned-entry_point_ldv-val-v0.8.cil.out.i [2022-11-02 20:32:05,564 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:32:05,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:32:05,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:32:05,712 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;@1edeb2a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:32:05,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:32:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 1573 states, 1105 states have (on average 1.4) internal successors, (1547), 1170 states have internal predecessors, (1547), 375 states have call successors, (375), 92 states have call predecessors, (375), 91 states have return successors, (366), 340 states have call predecessors, (366), 366 states have call successors, (366) [2022-11-02 20:32:05,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:32:05,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:05,745 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] [2022-11-02 20:32:05,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:05,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash 553944102, now seen corresponding path program 1 times [2022-11-02 20:32:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:05,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982589867] [2022-11-02 20:32:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:05,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:32:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:32:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:32:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:32:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:32:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:06,715 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 20:32:06,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:06,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982589867] [2022-11-02 20:32:06,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982589867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:06,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:06,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:32:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510239528] [2022-11-02 20:32:06,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:06,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:32:06,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:32:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:32:06,778 INFO L87 Difference]: Start difference. First operand has 1573 states, 1105 states have (on average 1.4) internal successors, (1547), 1170 states have internal predecessors, (1547), 375 states have call successors, (375), 92 states have call predecessors, (375), 91 states have return successors, (366), 340 states have call predecessors, (366), 366 states have call successors, (366) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 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 20:32:14,556 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 20:32:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:17,353 INFO L93 Difference]: Finished difference Result 3299 states and 4906 transitions. [2022-11-02 20:32:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:32:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 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 113 [2022-11-02 20:32:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:17,412 INFO L225 Difference]: With dead ends: 3299 [2022-11-02 20:32:17,416 INFO L226 Difference]: Without dead ends: 1715 [2022-11-02 20:32:17,431 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 20:32:17,434 INFO L413 NwaCegarLoop]: 2105 mSDtfsCounter, 1162 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 1001 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1001 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:17,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3630 Invalid, 2630 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1001 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-11-02 20:32:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2022-11-02 20:32:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1557. [2022-11-02 20:32:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1100 states have (on average 1.3909090909090909) internal successors, (1530), 1154 states have internal predecessors, (1530), 366 states have call successors, (366), 91 states have call predecessors, (366), 90 states have return successors, (361), 335 states have call predecessors, (361), 361 states have call successors, (361) [2022-11-02 20:32:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2257 transitions. [2022-11-02 20:32:17,637 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2257 transitions. Word has length 113 [2022-11-02 20:32:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:17,637 INFO L495 AbstractCegarLoop]: Abstraction has 1557 states and 2257 transitions. [2022-11-02 20:32:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 2 states have internal predecessors, (47), 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 20:32:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2257 transitions. [2022-11-02 20:32:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 20:32:17,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:17,650 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] [2022-11-02 20:32:17,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:32:17,651 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:17,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash -486862562, now seen corresponding path program 1 times [2022-11-02 20:32:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:17,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619120099] [2022-11-02 20:32:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:32:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:32:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:32:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:32:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:32:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:18,490 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 20:32:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:18,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619120099] [2022-11-02 20:32:18,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619120099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:18,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:18,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:32:18,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147017197] [2022-11-02 20:32:18,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:18,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:32:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:32:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:18,494 INFO L87 Difference]: Start difference. First operand 1557 states and 2257 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (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 20:32:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:34,856 INFO L93 Difference]: Finished difference Result 4937 states and 7621 transitions. [2022-11-02 20:32:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:32:34,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (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 113 [2022-11-02 20:32:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:34,883 INFO L225 Difference]: With dead ends: 4937 [2022-11-02 20:32:34,884 INFO L226 Difference]: Without dead ends: 3403 [2022-11-02 20:32:34,897 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 20:32:34,898 INFO L413 NwaCegarLoop]: 2630 mSDtfsCounter, 4138 mSDsluCounter, 3434 mSDsCounter, 0 mSdLazyCounter, 3313 mSolverCounterSat, 2161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4341 SdHoareTripleChecker+Valid, 6064 SdHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2161 IncrementalHoareTripleChecker+Valid, 3313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:34,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4341 Valid, 6064 Invalid, 5474 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2161 Valid, 3313 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2022-11-02 20:32:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2022-11-02 20:32:35,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3173. [2022-11-02 20:32:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3173 states, 2237 states have (on average 1.3844434510505141) internal successors, (3097), 2352 states have internal predecessors, (3097), 731 states have call successors, (731), 180 states have call predecessors, (731), 204 states have return successors, (933), 693 states have call predecessors, (933), 726 states have call successors, (933) [2022-11-02 20:32:35,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 4761 transitions. [2022-11-02 20:32:35,193 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 4761 transitions. Word has length 113 [2022-11-02 20:32:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:35,196 INFO L495 AbstractCegarLoop]: Abstraction has 3173 states and 4761 transitions. [2022-11-02 20:32:35,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (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 20:32:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 4761 transitions. [2022-11-02 20:32:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-02 20:32:35,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:35,208 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 20:32:35,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:32:35,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:35,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2086592435, now seen corresponding path program 1 times [2022-11-02 20:32:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:35,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737835887] [2022-11-02 20:32:35,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:32:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:32:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:32:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:32:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:32:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:35,873 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 20:32:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:35,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737835887] [2022-11-02 20:32:35,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737835887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:35,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:35,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:32:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79345128] [2022-11-02 20:32:35,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:35,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:32:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:32:35,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:35,882 INFO L87 Difference]: Start difference. First operand 3173 states and 4761 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 20:32:45,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:32:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:32:55,513 INFO L93 Difference]: Finished difference Result 9905 states and 15904 transitions. [2022-11-02 20:32:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:32:55,514 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 20:32:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:32:55,566 INFO L225 Difference]: With dead ends: 9905 [2022-11-02 20:32:55,566 INFO L226 Difference]: Without dead ends: 6755 [2022-11-02 20:32:55,590 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 20:32:55,591 INFO L413 NwaCegarLoop]: 2669 mSDtfsCounter, 4097 mSDsluCounter, 4242 mSDsCounter, 0 mSdLazyCounter, 4377 mSolverCounterSat, 2136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4308 SdHoareTripleChecker+Valid, 6911 SdHoareTripleChecker+Invalid, 6513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2136 IncrementalHoareTripleChecker+Valid, 4377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:32:55,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4308 Valid, 6911 Invalid, 6513 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2136 Valid, 4377 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2022-11-02 20:32:55,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6755 states. [2022-11-02 20:32:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6755 to 6338. [2022-11-02 20:32:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 4468 states have (on average 1.3831692032229186) internal successors, (6180), 4701 states have internal predecessors, (6180), 1455 states have call successors, (1455), 358 states have call predecessors, (1455), 414 states have return successors, (2225), 1387 states have call predecessors, (2225), 1450 states have call successors, (2225) [2022-11-02 20:32:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 9860 transitions. [2022-11-02 20:32:56,040 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 9860 transitions. Word has length 114 [2022-11-02 20:32:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:32:56,041 INFO L495 AbstractCegarLoop]: Abstraction has 6338 states and 9860 transitions. [2022-11-02 20:32:56,041 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 20:32:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 9860 transitions. [2022-11-02 20:32:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 20:32:56,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:32:56,044 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 20:32:56,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:32:56,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:32:56,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:32:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash 259323585, now seen corresponding path program 1 times [2022-11-02 20:32:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:32:56,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42728657] [2022-11-02 20:32:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:32:56,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:32:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:32:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:32:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:32:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:32:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:32:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:32:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:32:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:32:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:32:56,411 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 20:32:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:32:56,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42728657] [2022-11-02 20:32:56,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42728657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:32:56,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:32:56,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:32:56,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573117375] [2022-11-02 20:32:56,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:32:56,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:32:56,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:32:56,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:32:56,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:32:56,418 INFO L87 Difference]: Start difference. First operand 6338 states and 9860 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 20:33:05,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:33:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:06,987 INFO L93 Difference]: Finished difference Result 6753 states and 10628 transitions. [2022-11-02 20:33:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:33:06,988 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 20:33:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:07,030 INFO L225 Difference]: With dead ends: 6753 [2022-11-02 20:33:07,030 INFO L226 Difference]: Without dead ends: 6750 [2022-11-02 20:33:07,034 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 20:33:07,035 INFO L413 NwaCegarLoop]: 2669 mSDtfsCounter, 5211 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 3090 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5422 SdHoareTripleChecker+Valid, 5151 SdHoareTripleChecker+Invalid, 5403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3090 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:07,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5422 Valid, 5151 Invalid, 5403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3090 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-11-02 20:33:07,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6750 states. [2022-11-02 20:33:07,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6750 to 6339. [2022-11-02 20:33:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 4469 states have (on average 1.3830834638621616) internal successors, (6181), 4702 states have internal predecessors, (6181), 1455 states have call successors, (1455), 358 states have call predecessors, (1455), 414 states have return successors, (2225), 1387 states have call predecessors, (2225), 1450 states have call successors, (2225) [2022-11-02 20:33:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 9861 transitions. [2022-11-02 20:33:07,405 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 9861 transitions. Word has length 115 [2022-11-02 20:33:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:07,406 INFO L495 AbstractCegarLoop]: Abstraction has 6339 states and 9861 transitions. [2022-11-02 20:33:07,407 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 20:33:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 9861 transitions. [2022-11-02 20:33:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-02 20:33:07,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:07,410 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 20:33:07,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:33:07,410 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash -551431050, now seen corresponding path program 1 times [2022-11-02 20:33:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:07,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162643497] [2022-11-02 20:33:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:33:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:33:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:33:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:33:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:33:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:33:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:07,716 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 20:33:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:07,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162643497] [2022-11-02 20:33:07,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162643497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:07,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399230325] [2022-11-02 20:33:07,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:07,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:07,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:07,719 INFO L87 Difference]: Start difference. First operand 6339 states and 9861 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 20:33:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:19,794 INFO L93 Difference]: Finished difference Result 6749 states and 10624 transitions. [2022-11-02 20:33:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:19,795 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 20:33:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:19,834 INFO L225 Difference]: With dead ends: 6749 [2022-11-02 20:33:19,834 INFO L226 Difference]: Without dead ends: 6746 [2022-11-02 20:33:19,838 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 20:33:19,839 INFO L413 NwaCegarLoop]: 2046 mSDtfsCounter, 3001 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 1270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3208 SdHoareTripleChecker+Valid, 4279 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1270 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:19,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3208 Valid, 4279 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1270 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-11-02 20:33:19,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6746 states. [2022-11-02 20:33:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6746 to 6338. [2022-11-02 20:33:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6338 states, 4469 states have (on average 1.3828597001566345) internal successors, (6180), 4701 states have internal predecessors, (6180), 1454 states have call successors, (1454), 358 states have call predecessors, (1454), 414 states have return successors, (2225), 1387 states have call predecessors, (2225), 1450 states have call successors, (2225) [2022-11-02 20:33:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6338 states to 6338 states and 9859 transitions. [2022-11-02 20:33:20,218 INFO L78 Accepts]: Start accepts. Automaton has 6338 states and 9859 transitions. Word has length 116 [2022-11-02 20:33:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:20,218 INFO L495 AbstractCegarLoop]: Abstraction has 6338 states and 9859 transitions. [2022-11-02 20:33:20,219 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 20:33:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6338 states and 9859 transitions. [2022-11-02 20:33:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 20:33:20,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:20,222 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 20:33:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:33:20,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash 84983908, now seen corresponding path program 1 times [2022-11-02 20:33:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:20,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759484101] [2022-11-02 20:33:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:20,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:33:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:33:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:33:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:33:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:33:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:33:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:20,576 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 20:33:20,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:20,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759484101] [2022-11-02 20:33:20,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759484101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:20,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:20,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:33:20,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527845069] [2022-11-02 20:33:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:20,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:33:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:33:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:33:20,579 INFO L87 Difference]: Start difference. First operand 6338 states and 9859 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 20:33:28,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:28,766 INFO L93 Difference]: Finished difference Result 6748 states and 10622 transitions. [2022-11-02 20:33:28,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:33:28,766 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 20:33:28,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:28,807 INFO L225 Difference]: With dead ends: 6748 [2022-11-02 20:33:28,807 INFO L226 Difference]: Without dead ends: 6715 [2022-11-02 20:33:28,816 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 20:33:28,817 INFO L413 NwaCegarLoop]: 2042 mSDtfsCounter, 3000 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 1269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3207 SdHoareTripleChecker+Valid, 3594 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1269 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:28,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3207 Valid, 3594 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1269 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2022-11-02 20:33:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6715 states. [2022-11-02 20:33:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6715 to 6307. [2022-11-02 20:33:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6307 states, 4452 states have (on average 1.383423180592992) internal successors, (6159), 4683 states have internal predecessors, (6159), 1441 states have call successors, (1441), 357 states have call predecessors, (1441), 413 states have return successors, (2189), 1375 states have call predecessors, (2189), 1438 states have call successors, (2189) [2022-11-02 20:33:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6307 states to 6307 states and 9789 transitions. [2022-11-02 20:33:29,269 INFO L78 Accepts]: Start accepts. Automaton has 6307 states and 9789 transitions. Word has length 117 [2022-11-02 20:33:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:29,270 INFO L495 AbstractCegarLoop]: Abstraction has 6307 states and 9789 transitions. [2022-11-02 20:33:29,270 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 20:33:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6307 states and 9789 transitions. [2022-11-02 20:33:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-02 20:33:29,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:29,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:29,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:33:29,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1591193740, now seen corresponding path program 1 times [2022-11-02 20:33:29,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:29,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414809767] [2022-11-02 20:33:29,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:29,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:33:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:33:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:33:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:33:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:33:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:33:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:33:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:33:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 20:33:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:33:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:33:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:33:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:33:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-02 20:33:29,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:29,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414809767] [2022-11-02 20:33:29,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414809767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:29,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:29,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:33:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330420465] [2022-11-02 20:33:29,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:29,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:33:29,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:33:29,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:29,703 INFO L87 Difference]: Start difference. First operand 6307 states and 9789 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 3 states have internal predecessors, (86), 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 20:33:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:43,637 INFO L93 Difference]: Finished difference Result 19703 states and 30995 transitions. [2022-11-02 20:33:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:33:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 3 states have internal predecessors, (86), 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 177 [2022-11-02 20:33:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:43,831 INFO L225 Difference]: With dead ends: 19703 [2022-11-02 20:33:43,831 INFO L226 Difference]: Without dead ends: 13419 [2022-11-02 20:33:43,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:33:43,868 INFO L413 NwaCegarLoop]: 2253 mSDtfsCounter, 6517 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 4037 mSolverCounterSat, 4978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6833 SdHoareTripleChecker+Valid, 5249 SdHoareTripleChecker+Invalid, 9015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4978 IncrementalHoareTripleChecker+Valid, 4037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:43,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6833 Valid, 5249 Invalid, 9015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4978 Valid, 4037 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-11-02 20:33:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13419 states. [2022-11-02 20:33:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13419 to 12364. [2022-11-02 20:33:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12364 states, 8645 states have (on average 1.3754771544245228) internal successors, (11891), 9131 states have internal predecessors, (11891), 2766 states have call successors, (2766), 677 states have call predecessors, (2766), 952 states have return successors, (4654), 2823 states have call predecessors, (4654), 2763 states have call successors, (4654) [2022-11-02 20:33:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12364 states to 12364 states and 19311 transitions. [2022-11-02 20:33:44,843 INFO L78 Accepts]: Start accepts. Automaton has 12364 states and 19311 transitions. Word has length 177 [2022-11-02 20:33:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:44,844 INFO L495 AbstractCegarLoop]: Abstraction has 12364 states and 19311 transitions. [2022-11-02 20:33:44,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 3 states have internal predecessors, (86), 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 20:33:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 12364 states and 19311 transitions. [2022-11-02 20:33:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-02 20:33:44,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:44,871 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-11-02 20:33:44,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:33:44,871 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:44,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1990904647, now seen corresponding path program 1 times [2022-11-02 20:33:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:44,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734034504] [2022-11-02 20:33:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:33:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:33:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:33:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:33:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:33:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:33:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:33:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:33:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 20:33:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:33:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:33:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:33:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 20:33:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:33:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-11-02 20:33:45,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:45,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734034504] [2022-11-02 20:33:45,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734034504] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:45,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:45,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:33:45,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870563250] [2022-11-02 20:33:45,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:45,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:33:45,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:45,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:33:45,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:33:45,514 INFO L87 Difference]: Start difference. First operand 12364 states and 19311 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 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 20:33:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:33:57,088 INFO L93 Difference]: Finished difference Result 28349 states and 45205 transitions. [2022-11-02 20:33:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:33:57,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 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 215 [2022-11-02 20:33:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:33:57,175 INFO L225 Difference]: With dead ends: 28349 [2022-11-02 20:33:57,175 INFO L226 Difference]: Without dead ends: 16008 [2022-11-02 20:33:57,222 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 20:33:57,223 INFO L413 NwaCegarLoop]: 2306 mSDtfsCounter, 5786 mSDsluCounter, 3409 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 4184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6069 SdHoareTripleChecker+Valid, 5715 SdHoareTripleChecker+Invalid, 7280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4184 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:33:57,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6069 Valid, 5715 Invalid, 7280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4184 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-11-02 20:33:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16008 states. [2022-11-02 20:33:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16008 to 12378. [2022-11-02 20:33:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12378 states, 8659 states have (on average 1.3748700773761404) internal successors, (11905), 9145 states have internal predecessors, (11905), 2766 states have call successors, (2766), 677 states have call predecessors, (2766), 952 states have return successors, (4654), 2823 states have call predecessors, (4654), 2763 states have call successors, (4654) [2022-11-02 20:33:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12378 states to 12378 states and 19325 transitions. [2022-11-02 20:33:58,344 INFO L78 Accepts]: Start accepts. Automaton has 12378 states and 19325 transitions. Word has length 215 [2022-11-02 20:33:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:33:58,344 INFO L495 AbstractCegarLoop]: Abstraction has 12378 states and 19325 transitions. [2022-11-02 20:33:58,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 4 states have internal predecessors, (108), 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 20:33:58,345 INFO L276 IsEmpty]: Start isEmpty. Operand 12378 states and 19325 transitions. [2022-11-02 20:33:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-11-02 20:33:58,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:33:58,370 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2022-11-02 20:33:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:33:58,370 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:33:58,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:33:58,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1424389125, now seen corresponding path program 1 times [2022-11-02 20:33:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:33:58,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297548533] [2022-11-02 20:33:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:33:58,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:33:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:33:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:33:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:33:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:33:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:33:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:33:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:33:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:33:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:33:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-02 20:33:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-02 20:33:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-02 20:33:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 20:33:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 20:33:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:33:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:33:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:33:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:33:58,949 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-11-02 20:33:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:33:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297548533] [2022-11-02 20:33:58,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297548533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:33:58,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:33:58,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:33:58,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981051386] [2022-11-02 20:33:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:33:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:33:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:33:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:33:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:33:58,952 INFO L87 Difference]: Start difference. First operand 12378 states and 19325 transitions. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 3 states have internal predecessors, (110), 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 20:34:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:15,584 INFO L93 Difference]: Finished difference Result 38646 states and 60820 transitions. [2022-11-02 20:34:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:34:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 3 states have internal predecessors, (110), 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 232 [2022-11-02 20:34:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:15,726 INFO L225 Difference]: With dead ends: 38646 [2022-11-02 20:34:15,727 INFO L226 Difference]: Without dead ends: 26252 [2022-11-02 20:34:15,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:34:15,779 INFO L413 NwaCegarLoop]: 3452 mSDtfsCounter, 4941 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 4039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5288 SdHoareTripleChecker+Valid, 7249 SdHoareTripleChecker+Invalid, 8266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4039 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:15,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5288 Valid, 7249 Invalid, 8266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4039 Valid, 4227 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-11-02 20:34:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26252 states. [2022-11-02 20:34:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26252 to 24205. [2022-11-02 20:34:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24205 states, 16967 states have (on average 1.3756704190487417) internal successors, (23341), 17905 states have internal predecessors, (23341), 5370 states have call successors, (5370), 1328 states have call predecessors, (5370), 1867 states have return successors, (8993), 5469 states have call predecessors, (8993), 5367 states have call successors, (8993) [2022-11-02 20:34:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24205 states to 24205 states and 37704 transitions. [2022-11-02 20:34:17,474 INFO L78 Accepts]: Start accepts. Automaton has 24205 states and 37704 transitions. Word has length 232 [2022-11-02 20:34:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:17,475 INFO L495 AbstractCegarLoop]: Abstraction has 24205 states and 37704 transitions. [2022-11-02 20:34:17,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 3 states have internal predecessors, (110), 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 20:34:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 24205 states and 37704 transitions. [2022-11-02 20:34:17,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-11-02 20:34:17,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:17,548 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:34:17,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:34:17,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:17,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1357421709, now seen corresponding path program 1 times [2022-11-02 20:34:17,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:17,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283530910] [2022-11-02 20:34:17,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:17,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:34:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:34:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:34:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:34:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:34:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:34:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:34:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-02 20:34:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:34:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-02 20:34:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 20:34:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 20:34:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-02 20:34:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-02 20:34:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-02 20:34:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 20:34:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-02 20:34:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-02 20:34:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-11-02 20:34:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:18,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283530910] [2022-11-02 20:34:18,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283530910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:18,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:18,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:34:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143191731] [2022-11-02 20:34:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:18,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:34:18,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:34:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:34:18,245 INFO L87 Difference]: Start difference. First operand 24205 states and 37704 transitions. Second operand has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 3 states have internal predecessors, (123), 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 20:34:29,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:29,372 INFO L93 Difference]: Finished difference Result 40656 states and 63329 transitions. [2022-11-02 20:34:29,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:34:29,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 3 states have internal predecessors, (123), 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 258 [2022-11-02 20:34:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:29,456 INFO L225 Difference]: With dead ends: 40656 [2022-11-02 20:34:29,456 INFO L226 Difference]: Without dead ends: 16482 [2022-11-02 20:34:29,540 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 20:34:29,541 INFO L413 NwaCegarLoop]: 1976 mSDtfsCounter, 3755 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 3428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3836 SdHoareTripleChecker+Valid, 4590 SdHoareTripleChecker+Invalid, 6408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3428 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:29,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3836 Valid, 4590 Invalid, 6408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3428 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-11-02 20:34:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16482 states. [2022-11-02 20:34:31,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16482 to 15016. [2022-11-02 20:34:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15016 states, 10503 states have (on average 1.3720841664286394) internal successors, (14411), 11082 states have internal predecessors, (14411), 3341 states have call successors, (3341), 854 states have call predecessors, (3341), 1171 states have return successors, (5304), 3386 states have call predecessors, (5304), 3338 states have call successors, (5304) [2022-11-02 20:34:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15016 states to 15016 states and 23056 transitions. [2022-11-02 20:34:31,353 INFO L78 Accepts]: Start accepts. Automaton has 15016 states and 23056 transitions. Word has length 258 [2022-11-02 20:34:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:34:31,354 INFO L495 AbstractCegarLoop]: Abstraction has 15016 states and 23056 transitions. [2022-11-02 20:34:31,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.666666666666666) internal successors, (123), 3 states have internal predecessors, (123), 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 20:34:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15016 states and 23056 transitions. [2022-11-02 20:34:31,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-11-02 20:34:31,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:34:31,418 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] [2022-11-02 20:34:31,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:34:31,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:34:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:34:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1637114528, now seen corresponding path program 1 times [2022-11-02 20:34:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:34:31,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471296042] [2022-11-02 20:34:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:34:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:34:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:34:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:34:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:34:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:34:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:34:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:34:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:34:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:34:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:34:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:34:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:34:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:34:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:34:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:34:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:34:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:34:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 20:34:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:34:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-02 20:34:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:34:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:34:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:34:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:34:34,369 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 20:34:34,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:34:34,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471296042] [2022-11-02 20:34:34,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471296042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:34:34,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:34:34,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-02 20:34:34,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132415002] [2022-11-02 20:34:34,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:34:34,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:34:34,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:34:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:34:34,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:34:34,373 INFO L87 Difference]: Start difference. First operand 15016 states and 23056 transitions. Second operand has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 4 states have internal predecessors, (157), 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) [2022-11-02 20:34:48,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 20:34:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:34:58,413 INFO L93 Difference]: Finished difference Result 34182 states and 54719 transitions. [2022-11-02 20:34:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:34:58,414 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 4 states have internal predecessors, (157), 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) Word has length 275 [2022-11-02 20:34:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:34:58,512 INFO L225 Difference]: With dead ends: 34182 [2022-11-02 20:34:58,512 INFO L226 Difference]: Without dead ends: 19199 [2022-11-02 20:34:58,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:34:58,572 INFO L413 NwaCegarLoop]: 1973 mSDtfsCounter, 3274 mSDsluCounter, 6882 mSDsCounter, 0 mSdLazyCounter, 7046 mSolverCounterSat, 2875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3484 SdHoareTripleChecker+Valid, 8855 SdHoareTripleChecker+Invalid, 9921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2875 IncrementalHoareTripleChecker+Valid, 7046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:34:58,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3484 Valid, 8855 Invalid, 9921 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2875 Valid, 7046 Invalid, 0 Unknown, 0 Unchecked, 21.5s Time] [2022-11-02 20:34:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19199 states. [2022-11-02 20:35:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19199 to 17406. [2022-11-02 20:35:00,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17406 states, 12118 states have (on average 1.3736590196402048) internal successors, (16646), 12817 states have internal predecessors, (16646), 3981 states have call successors, (3981), 854 states have call predecessors, (3981), 1306 states have return successors, (6685), 4121 states have call predecessors, (6685), 3978 states have call successors, (6685) [2022-11-02 20:35:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17406 states to 17406 states and 27312 transitions. [2022-11-02 20:35:00,863 INFO L78 Accepts]: Start accepts. Automaton has 17406 states and 27312 transitions. Word has length 275 [2022-11-02 20:35:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:35:00,864 INFO L495 AbstractCegarLoop]: Abstraction has 17406 states and 27312 transitions. [2022-11-02 20:35:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 4 states have internal predecessors, (157), 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) [2022-11-02 20:35:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 17406 states and 27312 transitions. [2022-11-02 20:35:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-11-02 20:35:00,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:35:00,915 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1] [2022-11-02 20:35:00,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:35:00,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:35:00,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:35:00,916 INFO L85 PathProgramCache]: Analyzing trace with hash -434647153, now seen corresponding path program 1 times [2022-11-02 20:35:00,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:35:00,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668583903] [2022-11-02 20:35:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:35:00,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:35:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:35:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:35:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:35:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-02 20:35:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:35:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 20:35:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:35:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 20:35:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:35:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 20:35:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 20:35:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:35:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:35:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:35:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:35:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:35:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:35:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-02 20:35:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:35:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:35:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:35:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:35:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:35:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:35:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:35:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:35:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:35:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 20:35:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:35:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-02 20:35:01,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:35:01,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668583903] [2022-11-02 20:35:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668583903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:35:01,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:35:01,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:35:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882971855] [2022-11-02 20:35:01,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:35:01,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:35:01,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:35:01,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:35:01,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:35:01,996 INFO L87 Difference]: Start difference. First operand 17406 states and 27312 transitions. Second operand has 12 states, 12 states have (on average 13.166666666666666) internal successors, (158), 3 states have internal predecessors, (158), 2 states have call successors, (34), 11 states have call predecessors, (34), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33)