./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/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_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/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_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/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 73338d683e10a9827a18cf31e1247b64129367b1297cba22c91c243b4552d29d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:05:22,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:05:22,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:05:22,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:05:22,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:05:22,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:05:22,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:05:22,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:05:22,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:05:22,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:05:22,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:05:22,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:05:22,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:05:22,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:05:22,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:05:22,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:05:22,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:05:22,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:05:22,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:05:22,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:05:22,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:05:22,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:05:22,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:05:22,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:05:22,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:05:22,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:05:22,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:05:22,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:05:22,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:05:22,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:05:22,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:05:22,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:05:22,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:05:22,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:05:22,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:05:22,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:05:22,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:05:22,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:05:22,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:05:22,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:05:22,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:05:22,900 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:05:22,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:05:22,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:05:22,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:05:22,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:05:22,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:05:22,961 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:05:22,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:05:22,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:05:22,962 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:05:22,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:05:22,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:05:22,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:05:22,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:05:22,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:05:22,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:05:22,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:05:22,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:05:22,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:05:22,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:05:22,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:05:22,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:05:22,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:22,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:05:22,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:05:22,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:05:22,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:05:22,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:05:22,970 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:05:22,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:05:22,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:05:22,971 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_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/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_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/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 -> 73338d683e10a9827a18cf31e1247b64129367b1297cba22c91c243b4552d29d [2022-11-02 21:05:23,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:05:23,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:05:23,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:05:23,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:05:23,333 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:05:23,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-11-02 21:05:23,427 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/data/a14556e4b/fc55f0b7bddc474d860006e0ddac0534/FLAG2fc0ec11e [2022-11-02 21:05:24,387 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:05:24,389 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-11-02 21:05:24,445 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/data/a14556e4b/fc55f0b7bddc474d860006e0ddac0534/FLAG2fc0ec11e [2022-11-02 21:05:24,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/data/a14556e4b/fc55f0b7bddc474d860006e0ddac0534 [2022-11-02 21:05:24,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:05:24,800 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:05:24,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:24,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:05:24,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:05:24,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:24" (1/1) ... [2022-11-02 21:05:24,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca551a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:24, skipping insertion in model container [2022-11-02 21:05:24,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:05:24" (1/1) ... [2022-11-02 21:05:24,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:05:24,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:05:26,506 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_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[116401,116414] [2022-11-02 21:05:27,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:27,481 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:05:27,674 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_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i[116401,116414] [2022-11-02 21:05:27,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:05:28,180 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:05:28,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28 WrapperNode [2022-11-02 21:05:28,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:05:28,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:28,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:05:28,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:05:28,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,661 INFO L138 Inliner]: procedures = 245, calls = 3306, calls flagged for inlining = 118, calls inlined = 118, statements flattened = 6412 [2022-11-02 21:05:28,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:05:28,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:05:28,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:05:28,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:05:28,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,972 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:28,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:29,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:05:29,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:05:29,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:05:29,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:05:29,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (1/1) ... [2022-11-02 21:05:29,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:05:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:05:29,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:05:29,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_989fac51-ecb4-4eb4-9dbe-786b07bd1b06/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:05:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure acm_disconnect [2022-11-02 21:05:29,131 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_disconnect [2022-11-02 21:05:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_tty_hangup [2022-11-02 21:05:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_tty_hangup [2022-11-02 21:05:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_18 [2022-11-02 21:05:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_18 [2022-11-02 21:05:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 21:05:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 21:05:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:05:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure acm_port_destruct [2022-11-02 21:05:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_port_destruct [2022-11-02 21:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-11-02 21:05:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-11-02 21:05:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-11-02 21:05:29,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-11-02 21:05:29,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_22 [2022-11-02 21:05:29,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_22 [2022-11-02 21:05:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_cleanup [2022-11-02 21:05:29,135 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_cleanup [2022-11-02 21:05:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:05:29,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:05:29,135 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-11-02 21:05:29,135 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-11-02 21:05:29,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-11-02 21:05:29,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-11-02 21:05:29,136 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_buffers_free [2022-11-02 21:05:29,136 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_buffers_free [2022-11-02 21:05:29,136 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 21:05:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 21:05:29,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 21:05:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 21:05:29,137 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-11-02 21:05:29,137 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-11-02 21:05:29,137 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2022-11-02 21:05:29,138 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2022-11-02 21:05:29,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 21:05:29,138 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 21:05:29,139 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:05:29,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:05:29,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-11-02 21:05:29,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-11-02 21:05:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-02 21:05:29,140 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-02 21:05:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_put [2022-11-02 21:05:29,140 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_put [2022-11-02 21:05:29,140 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_chars_in_buffer [2022-11-02 21:05:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_chars_in_buffer [2022-11-02 21:05:29,141 INFO L130 BoogieDeclarations]: Found specification of procedure acm_resume [2022-11-02 21:05:29,141 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_resume [2022-11-02 21:05:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:05:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 21:05:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure acm_ctrl_msg [2022-11-02 21:05:29,142 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_ctrl_msg [2022-11-02 21:05:29,142 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-02 21:05:29,143 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-02 21:05:29,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:05:29,144 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_hangup [2022-11-02 21:05:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_hangup [2022-11-02 21:05:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-11-02 21:05:29,145 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-11-02 21:05:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-11-02 21:05:29,145 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-02 21:05:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-02 21:05:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2022-11-02 21:05:29,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2022-11-02 21:05:29,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-02 21:05:29,147 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-02 21:05:29,147 INFO L130 BoogieDeclarations]: Found specification of procedure put_tty_driver [2022-11-02 21:05:29,148 INFO L138 BoogieDeclarations]: Found implementation of procedure put_tty_driver [2022-11-02 21:05:29,148 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 21:05:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 21:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-02 21:05:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-02 21:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-11-02 21:05:29,149 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-11-02 21:05:29,149 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmget [2022-11-02 21:05:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmget [2022-11-02 21:05:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure acm_port_shutdown [2022-11-02 21:05:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_port_shutdown [2022-11-02 21:05:29,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2022-11-02 21:05:29,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2022-11-02 21:05:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_set_termios [2022-11-02 21:05:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_set_termios [2022-11-02 21:05:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 21:05:29,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 21:05:29,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 21:05:29,152 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-02 21:05:29,152 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-02 21:05:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_break_ctl [2022-11-02 21:05:29,153 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_break_ctl [2022-11-02 21:05:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-02 21:05:29,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-02 21:05:29,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 21:05:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_7 [2022-11-02 21:05:29,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_7 [2022-11-02 21:05:29,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2022-11-02 21:05:29,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2022-11-02 21:05:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2022-11-02 21:05:29,156 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2022-11-02 21:05:29,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:05:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure acm_start_wb [2022-11-02 21:05:29,157 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_start_wb [2022-11-02 21:05:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-11-02 21:05:29,157 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-11-02 21:05:29,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 21:05:29,157 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 21:05:29,158 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 21:05:29,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 21:05:29,158 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_throttle [2022-11-02 21:05:29,159 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_throttle [2022-11-02 21:05:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure acm_wb_is_avail [2022-11-02 21:05:29,159 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_wb_is_avail [2022-11-02 21:05:29,159 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-02 21:05:29,159 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-02 21:05:29,160 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 21:05:29,161 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 21:05:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_write_room [2022-11-02 21:05:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_write_room [2022-11-02 21:05:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urb [2022-11-02 21:05:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urb [2022-11-02 21:05:29,165 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 21:05:29,166 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 21:05:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:05:29,167 INFO L130 BoogieDeclarations]: Found specification of procedure acm_write_done [2022-11-02 21:05:29,168 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_write_done [2022-11-02 21:05:29,173 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_ioctl [2022-11-02 21:05:29,174 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_ioctl [2022-11-02 21:05:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure acm_release_minor [2022-11-02 21:05:29,174 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_release_minor [2022-11-02 21:05:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-11-02 21:05:29,174 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-11-02 21:05:29,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 21:05:29,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 21:05:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface_async [2022-11-02 21:05:29,175 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface_async [2022-11-02 21:05:29,175 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_unthrottle [2022-11-02 21:05:29,175 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_unthrottle [2022-11-02 21:05:29,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:05:29,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_3 [2022-11-02 21:05:29,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_3 [2022-11-02 21:05:29,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:05:29,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 21:05:29,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 21:05:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:05:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_17 [2022-11-02 21:05:29,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_17 [2022-11-02 21:05:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:05:29,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:05:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-11-02 21:05:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-11-02 21:05:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-11-02 21:05:29,178 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-11-02 21:05:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure acm_read_buffers_free [2022-11-02 21:05:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_read_buffers_free [2022-11-02 21:05:29,179 INFO L130 BoogieDeclarations]: Found specification of procedure acm_ctrl_irq [2022-11-02 21:05:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_ctrl_irq [2022-11-02 21:05:29,179 INFO L130 BoogieDeclarations]: Found specification of procedure acm_submit_read_urbs [2022-11-02 21:05:29,179 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_submit_read_urbs [2022-11-02 21:05:29,179 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_install [2022-11-02 21:05:29,180 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_install [2022-11-02 21:05:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure stop_data_traffic [2022-11-02 21:05:29,180 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_data_traffic [2022-11-02 21:05:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-02 21:05:29,180 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-02 21:05:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-02 21:05:29,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-02 21:05:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:05:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-11-02 21:05:29,181 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-11-02 21:05:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-11-02 21:05:29,182 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-11-02 21:05:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure acm_tty_tiocmset [2022-11-02 21:05:29,182 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_tty_tiocmset [2022-11-02 21:05:29,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:05:29,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:05:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure tty_unregister_driver [2022-11-02 21:05:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_unregister_driver [2022-11-02 21:05:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure acm_read_bulk_callback [2022-11-02 21:05:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure acm_read_bulk_callback [2022-11-02 21:05:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-11-02 21:05:29,183 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-11-02 21:05:30,114 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:05:30,119 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:05:30,460 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:05:31,201 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-11-02 21:05:40,050 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:05:40,086 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:05:40,088 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:05:40,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:40 BoogieIcfgContainer [2022-11-02 21:05:40,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:05:40,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:05:40,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:05:40,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:05:40,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:05:24" (1/3) ... [2022-11-02 21:05:40,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce0170e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:40, skipping insertion in model container [2022-11-02 21:05:40,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:05:28" (2/3) ... [2022-11-02 21:05:40,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce0170e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:05:40, skipping insertion in model container [2022-11-02 21:05:40,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:05:40" (3/3) ... [2022-11-02 21:05:40,104 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--usb--class--cdc-acm.ko-entry_point.cil.out.i [2022-11-02 21:05:40,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:05:40,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:05:40,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:05:40,273 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;@2eeed615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:05:40,273 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:05:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 1493 states, 1064 states have (on average 1.3449248120300752) internal successors, (1431), 1100 states have internal predecessors, (1431), 346 states have call successors, (346), 83 states have call predecessors, (346), 81 states have return successors, (335), 327 states have call predecessors, (335), 335 states have call successors, (335) [2022-11-02 21:05:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-02 21:05:40,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:40,315 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:40,316 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1074681228, now seen corresponding path program 1 times [2022-11-02 21:05:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654685561] [2022-11-02 21:05:40,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:05:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:05:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:05:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:05:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:05:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:05:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:05:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:05:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:05:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:05:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:05:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:05:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:05:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:05:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:05:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 21:05:41,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:41,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654685561] [2022-11-02 21:05:41,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654685561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:41,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:41,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:05:41,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120212980] [2022-11-02 21:05:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:41,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:05:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:05:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:05:41,976 INFO L87 Difference]: Start difference. First operand has 1493 states, 1064 states have (on average 1.3449248120300752) internal successors, (1431), 1100 states have internal predecessors, (1431), 346 states have call successors, (346), 83 states have call predecessors, (346), 81 states have return successors, (335), 327 states have call predecessors, (335), 335 states have call successors, (335) Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:05:46,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:48,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:05:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:05:56,417 INFO L93 Difference]: Finished difference Result 4571 states and 6678 transitions. [2022-11-02 21:05:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:05:56,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 4 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 117 [2022-11-02 21:05:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:05:56,499 INFO L225 Difference]: With dead ends: 4571 [2022-11-02 21:05:56,499 INFO L226 Difference]: Without dead ends: 3049 [2022-11-02 21:05:56,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:05:56,515 INFO L413 NwaCegarLoop]: 2274 mSDtfsCounter, 2983 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 1667 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3235 SdHoareTripleChecker+Valid, 5786 SdHoareTripleChecker+Invalid, 3986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1667 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:05:56,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3235 Valid, 5786 Invalid, 3986 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1667 Valid, 2317 Invalid, 2 Unknown, 0 Unchecked, 13.8s Time] [2022-11-02 21:05:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2022-11-02 21:05:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 2862. [2022-11-02 21:05:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2063 states have (on average 1.3364032961706254) internal successors, (2757), 2104 states have internal predecessors, (2757), 638 states have call successors, (638), 161 states have call predecessors, (638), 160 states have return successors, (632), 616 states have call predecessors, (632), 632 states have call successors, (632) [2022-11-02 21:05:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 4027 transitions. [2022-11-02 21:05:56,831 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 4027 transitions. Word has length 117 [2022-11-02 21:05:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:05:56,837 INFO L495 AbstractCegarLoop]: Abstraction has 2862 states and 4027 transitions. [2022-11-02 21:05:56,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:05:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 4027 transitions. [2022-11-02 21:05:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-02 21:05:56,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:05:56,853 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:05:56,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:05:56,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:05:56,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:05:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1971538155, now seen corresponding path program 1 times [2022-11-02 21:05:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:05:56,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835323260] [2022-11-02 21:05:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:05:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:05:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:05:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:05:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:05:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:05:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:05:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:05:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:05:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:05:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:05:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:05:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:05:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:05:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:05:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:05:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:05:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:05:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:05:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:05:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:05:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 21:05:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:05:58,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835323260] [2022-11-02 21:05:58,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835323260] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:05:58,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:05:58,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:05:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625218202] [2022-11-02 21:05:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:05:58,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:05:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:05:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:05:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:05:58,608 INFO L87 Difference]: Start difference. First operand 2862 states and 4027 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:02,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:04,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:15,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:17,756 INFO L93 Difference]: Finished difference Result 9103 states and 13201 transitions. [2022-11-02 21:06:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:06:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (19), 5 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 129 [2022-11-02 21:06:17,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:17,806 INFO L225 Difference]: With dead ends: 9103 [2022-11-02 21:06:17,806 INFO L226 Difference]: Without dead ends: 6274 [2022-11-02 21:06:17,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:06:17,823 INFO L413 NwaCegarLoop]: 2367 mSDtfsCounter, 3123 mSDsluCounter, 4746 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 1783 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 7113 SdHoareTripleChecker+Invalid, 5124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1783 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:17,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 7113 Invalid, 5124 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1783 Valid, 3338 Invalid, 3 Unknown, 0 Unchecked, 18.6s Time] [2022-11-02 21:06:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2022-11-02 21:06:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 5787. [2022-11-02 21:06:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5787 states, 4175 states have (on average 1.3348502994011977) internal successors, (5573), 4258 states have internal predecessors, (5573), 1273 states have call successors, (1273), 321 states have call predecessors, (1273), 338 states have return successors, (1387), 1251 states have call predecessors, (1387), 1267 states have call successors, (1387) [2022-11-02 21:06:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 8233 transitions. [2022-11-02 21:06:18,233 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 8233 transitions. Word has length 129 [2022-11-02 21:06:18,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:18,235 INFO L495 AbstractCegarLoop]: Abstraction has 5787 states and 8233 transitions. [2022-11-02 21:06:18,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 8233 transitions. [2022-11-02 21:06:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-02 21:06:18,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:18,241 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:18,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:06:18,241 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash -988843388, now seen corresponding path program 1 times [2022-11-02 21:06:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:18,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237795194] [2022-11-02 21:06:18,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:18,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:06:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:06:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:06:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:06:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:06:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:06:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:06:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:06:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:06:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:06:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:06:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:06:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:06:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:06:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 21:06:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:19,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237795194] [2022-11-02 21:06:19,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237795194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:19,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:19,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367940581] [2022-11-02 21:06:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:19,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:19,544 INFO L87 Difference]: Start difference. First operand 5787 states and 8233 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:23,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:25,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:27,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:33,637 INFO L93 Difference]: Finished difference Result 6285 states and 9087 transitions. [2022-11-02 21:06:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:06:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (19), 5 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 130 [2022-11-02 21:06:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:33,672 INFO L225 Difference]: With dead ends: 6285 [2022-11-02 21:06:33,673 INFO L226 Difference]: Without dead ends: 6282 [2022-11-02 21:06:33,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:06:33,678 INFO L413 NwaCegarLoop]: 1942 mSDtfsCounter, 2442 mSDsluCounter, 2976 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 1034 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 4918 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:33,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2691 Valid, 4918 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1703 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2022-11-02 21:06:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6282 states. [2022-11-02 21:06:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6282 to 5794. [2022-11-02 21:06:34,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5794 states, 4179 states have (on average 1.334290500119646) internal successors, (5576), 4261 states have internal predecessors, (5576), 1272 states have call successors, (1272), 325 states have call predecessors, (1272), 342 states have return successors, (1387), 1251 states have call predecessors, (1387), 1267 states have call successors, (1387) [2022-11-02 21:06:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5794 states to 5794 states and 8235 transitions. [2022-11-02 21:06:34,030 INFO L78 Accepts]: Start accepts. Automaton has 5794 states and 8235 transitions. Word has length 130 [2022-11-02 21:06:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:34,031 INFO L495 AbstractCegarLoop]: Abstraction has 5794 states and 8235 transitions. [2022-11-02 21:06:34,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5794 states and 8235 transitions. [2022-11-02 21:06:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-02 21:06:34,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:34,035 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:06:34,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash -590071816, now seen corresponding path program 1 times [2022-11-02 21:06:34,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712497594] [2022-11-02 21:06:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:06:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:06:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:06:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:06:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:06:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:06:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:06:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:06:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:06:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:06:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:06:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:06:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:06:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:06:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 21:06:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712497594] [2022-11-02 21:06:34,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712497594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:34,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:34,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245687260] [2022-11-02 21:06:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:34,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:34,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:34,644 INFO L87 Difference]: Start difference. First operand 5794 states and 8235 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:38,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:40,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:06:46,503 INFO L93 Difference]: Finished difference Result 6272 states and 9069 transitions. [2022-11-02 21:06:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:06:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (19), 5 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 131 [2022-11-02 21:06:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:06:46,539 INFO L225 Difference]: With dead ends: 6272 [2022-11-02 21:06:46,539 INFO L226 Difference]: Without dead ends: 6269 [2022-11-02 21:06:46,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:06:46,544 INFO L413 NwaCegarLoop]: 1945 mSDtfsCounter, 2457 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 1037 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2703 SdHoareTripleChecker+Valid, 4875 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1037 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:06:46,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2703 Valid, 4875 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1037 Valid, 1700 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2022-11-02 21:06:46,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6269 states. [2022-11-02 21:06:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6269 to 5793. [2022-11-02 21:06:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5793 states, 4179 states have (on average 1.3340512084230678) internal successors, (5575), 4260 states have internal predecessors, (5575), 1271 states have call successors, (1271), 325 states have call predecessors, (1271), 342 states have return successors, (1387), 1251 states have call predecessors, (1387), 1267 states have call successors, (1387) [2022-11-02 21:06:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 8233 transitions. [2022-11-02 21:06:46,938 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 8233 transitions. Word has length 131 [2022-11-02 21:06:46,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:06:46,940 INFO L495 AbstractCegarLoop]: Abstraction has 5793 states and 8233 transitions. [2022-11-02 21:06:46,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 8233 transitions. [2022-11-02 21:06:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-11-02 21:06:46,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:06:46,945 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:06:46,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:06:46,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:06:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:06:46,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1113050105, now seen corresponding path program 1 times [2022-11-02 21:06:46,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:06:46,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024152981] [2022-11-02 21:06:46,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:06:46,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:06:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:06:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:06:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:06:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:06:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:06:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:06:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:06:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:06:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:06:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:06:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:06:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:06:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:06:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:06:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:06:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:06:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:06:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:06:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:06:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 21:06:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:06:47,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024152981] [2022-11-02 21:06:47,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024152981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:06:47,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:06:47,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:06:47,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415453895] [2022-11-02 21:06:47,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:06:47,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:06:47,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:06:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:06:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:06:47,581 INFO L87 Difference]: Start difference. First operand 5793 states and 8233 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:06:50,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:55,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:57,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:06:59,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:08,213 INFO L93 Difference]: Finished difference Result 18194 states and 26513 transitions. [2022-11-02 21:07:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:07:08,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 5 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 132 [2022-11-02 21:07:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:08,284 INFO L225 Difference]: With dead ends: 18194 [2022-11-02 21:07:08,284 INFO L226 Difference]: Without dead ends: 12434 [2022-11-02 21:07:08,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:07:08,313 INFO L413 NwaCegarLoop]: 2452 mSDtfsCounter, 2994 mSDsluCounter, 4930 mSDsCounter, 0 mSdLazyCounter, 3272 mSolverCounterSat, 1712 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3251 SdHoareTripleChecker+Valid, 7382 SdHoareTripleChecker+Invalid, 4988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1712 IncrementalHoareTripleChecker+Valid, 3272 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:08,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3251 Valid, 7382 Invalid, 4988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1712 Valid, 3272 Invalid, 4 Unknown, 0 Unchecked, 19.8s Time] [2022-11-02 21:07:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12434 states. [2022-11-02 21:07:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12434 to 11568. [2022-11-02 21:07:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11568 states, 8357 states have (on average 1.3349288022017471) internal successors, (11156), 8527 states have internal predecessors, (11156), 2512 states have call successors, (2512), 646 states have call predecessors, (2512), 698 states have return successors, (2955), 2486 states have call predecessors, (2955), 2505 states have call successors, (2955) [2022-11-02 21:07:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 16623 transitions. [2022-11-02 21:07:09,145 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 16623 transitions. Word has length 132 [2022-11-02 21:07:09,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:09,145 INFO L495 AbstractCegarLoop]: Abstraction has 11568 states and 16623 transitions. [2022-11-02 21:07:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:07:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 16623 transitions. [2022-11-02 21:07:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 21:07:09,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:09,150 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:07:09,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:07:09,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash -145503013, now seen corresponding path program 1 times [2022-11-02 21:07:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:09,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234358488] [2022-11-02 21:07:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:07:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:07:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:07:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:07:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:07:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:07:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:07:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:07:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:07:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:07:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:07:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:07:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:07:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:07:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:07:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:07:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-11-02 21:07:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:09,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234358488] [2022-11-02 21:07:09,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234358488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:09,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:09,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:07:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96349954] [2022-11-02 21:07:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:09,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:07:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:07:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:07:09,832 INFO L87 Difference]: Start difference. First operand 11568 states and 16623 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:07:13,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:16,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:19,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:24,509 INFO L93 Difference]: Finished difference Result 12414 states and 18115 transitions. [2022-11-02 21:07:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:07:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 5 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 133 [2022-11-02 21:07:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:24,568 INFO L225 Difference]: With dead ends: 12414 [2022-11-02 21:07:24,568 INFO L226 Difference]: Without dead ends: 12393 [2022-11-02 21:07:24,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:07:24,574 INFO L413 NwaCegarLoop]: 1945 mSDtfsCounter, 2435 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 1024 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 4913 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1024 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:24,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 4913 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1024 Valid, 1705 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2022-11-02 21:07:24,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12393 states. [2022-11-02 21:07:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12393 to 11549. [2022-11-02 21:07:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11549 states, 8343 states have (on average 1.3348915258300371) internal successors, (11137), 8512 states have internal predecessors, (11137), 2509 states have call successors, (2509), 644 states have call predecessors, (2509), 696 states have return successors, (2953), 2484 states have call predecessors, (2953), 2503 states have call successors, (2953) [2022-11-02 21:07:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11549 states to 11549 states and 16599 transitions. [2022-11-02 21:07:25,233 INFO L78 Accepts]: Start accepts. Automaton has 11549 states and 16599 transitions. Word has length 133 [2022-11-02 21:07:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:25,234 INFO L495 AbstractCegarLoop]: Abstraction has 11549 states and 16599 transitions. [2022-11-02 21:07:25,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:07:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 11549 states and 16599 transitions. [2022-11-02 21:07:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-02 21:07:25,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:25,240 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-11-02 21:07:25,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:07:25,241 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:25,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1006130556, now seen corresponding path program 1 times [2022-11-02 21:07:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:25,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892200576] [2022-11-02 21:07:25,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:07:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:07:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:07:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:07:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:07:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:07:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:07:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:07:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:07:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:07:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:07:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:07:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:07:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:07:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:07:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-02 21:07:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 21:07:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:07:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 21:07:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2022-11-02 21:07:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892200576] [2022-11-02 21:07:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892200576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:25,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:25,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68621201] [2022-11-02 21:07:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:25,992 INFO L87 Difference]: Start difference. First operand 11549 states and 16599 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:07:31,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:33,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:39,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:41,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:07:50,648 INFO L93 Difference]: Finished difference Result 36845 states and 53809 transitions. [2022-11-02 21:07:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:07:50,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2022-11-02 21:07:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:07:50,786 INFO L225 Difference]: With dead ends: 36845 [2022-11-02 21:07:50,787 INFO L226 Difference]: Without dead ends: 25329 [2022-11-02 21:07:50,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:07:50,835 INFO L413 NwaCegarLoop]: 2070 mSDtfsCounter, 3975 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 4664 mSolverCounterSat, 2241 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 5611 SdHoareTripleChecker+Invalid, 6909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2241 IncrementalHoareTripleChecker+Valid, 4664 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:07:50,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4303 Valid, 5611 Invalid, 6909 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2241 Valid, 4664 Invalid, 4 Unknown, 0 Unchecked, 22.7s Time] [2022-11-02 21:07:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25329 states. [2022-11-02 21:07:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25329 to 23011. [2022-11-02 21:07:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23011 states, 16621 states have (on average 1.3321701462005897) internal successors, (22142), 16996 states have internal predecessors, (22142), 4914 states have call successors, (4914), 1277 states have call predecessors, (4914), 1475 states have return successors, (6142), 4929 states have call predecessors, (6142), 4908 states have call successors, (6142) [2022-11-02 21:07:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23011 states to 23011 states and 33198 transitions. [2022-11-02 21:07:52,773 INFO L78 Accepts]: Start accepts. Automaton has 23011 states and 33198 transitions. Word has length 154 [2022-11-02 21:07:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:07:52,774 INFO L495 AbstractCegarLoop]: Abstraction has 23011 states and 33198 transitions. [2022-11-02 21:07:52,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:07:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23011 states and 33198 transitions. [2022-11-02 21:07:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-02 21:07:52,789 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:07:52,789 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-11-02 21:07:52,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:07:52,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:07:52,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:07:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1122281095, now seen corresponding path program 1 times [2022-11-02 21:07:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:07:52,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195102752] [2022-11-02 21:07:52,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:07:52,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:07:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:07:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:07:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:07:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:07:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:07:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:07:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:07:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:07:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:07:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:07:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:07:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:07:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:07:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:07:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:07:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:07:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:07:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-02 21:07:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 21:07:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-02 21:07:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-11-02 21:07:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-02 21:07:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:07:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:07:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-11-02 21:07:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:07:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-11-02 21:07:53,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:07:53,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195102752] [2022-11-02 21:07:53,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195102752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:07:53,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:07:53,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:07:53,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037639393] [2022-11-02 21:07:53,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:07:53,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:07:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:07:53,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:07:53,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:07:53,646 INFO L87 Difference]: Start difference. First operand 23011 states and 33198 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 21:07:56,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:07:58,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:00,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:05,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:08,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:10,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:12,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:14,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:30,033 INFO L93 Difference]: Finished difference Result 66244 states and 95908 transitions. [2022-11-02 21:08:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:08:30,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 213 [2022-11-02 21:08:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:30,271 INFO L225 Difference]: With dead ends: 66244 [2022-11-02 21:08:30,272 INFO L226 Difference]: Without dead ends: 43276 [2022-11-02 21:08:30,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:08:30,346 INFO L413 NwaCegarLoop]: 2326 mSDtfsCounter, 2946 mSDsluCounter, 4485 mSDsCounter, 0 mSdLazyCounter, 5188 mSolverCounterSat, 1776 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 6972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1776 IncrementalHoareTripleChecker+Valid, 5188 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:30,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 6811 Invalid, 6972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1776 Valid, 5188 Invalid, 8 Unknown, 0 Unchecked, 33.3s Time] [2022-11-02 21:08:30,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43276 states. [2022-11-02 21:08:33,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43276 to 40391. [2022-11-02 21:08:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40391 states, 29000 states have (on average 1.3188275862068966) internal successors, (38246), 29735 states have internal predecessors, (38246), 8654 states have call successors, (8654), 2338 states have call predecessors, (8654), 2736 states have return successors, (10996), 8685 states have call predecessors, (10996), 8648 states have call successors, (10996) [2022-11-02 21:08:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40391 states to 40391 states and 57896 transitions. [2022-11-02 21:08:33,489 INFO L78 Accepts]: Start accepts. Automaton has 40391 states and 57896 transitions. Word has length 213 [2022-11-02 21:08:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:33,490 INFO L495 AbstractCegarLoop]: Abstraction has 40391 states and 57896 transitions. [2022-11-02 21:08:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (35), 6 states have call predecessors, (35), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 21:08:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40391 states and 57896 transitions. [2022-11-02 21:08:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-02 21:08:33,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:33,516 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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] [2022-11-02 21:08:33,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:08:33,517 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash -306324402, now seen corresponding path program 1 times [2022-11-02 21:08:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:33,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924104674] [2022-11-02 21:08:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:08:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:08:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:08:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:08:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:08:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:08:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:08:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:08:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:08:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:08:34,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:08:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:08:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:08:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:08:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-02 21:08:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:08:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:08:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-02 21:08:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:08:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 21:08:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:08:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-02 21:08:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 21:08:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-02 21:08:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-11-02 21:08:34,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:34,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924104674] [2022-11-02 21:08:34,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924104674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:34,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:34,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:08:34,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558517116] [2022-11-02 21:08:34,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:34,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:08:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:34,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:08:34,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:08:34,556 INFO L87 Difference]: Start difference. First operand 40391 states and 57896 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 21:08:37,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:08:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:08:50,611 INFO L93 Difference]: Finished difference Result 85505 states and 124239 transitions. [2022-11-02 21:08:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:08:50,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 206 [2022-11-02 21:08:50,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:08:50,875 INFO L225 Difference]: With dead ends: 85505 [2022-11-02 21:08:50,876 INFO L226 Difference]: Without dead ends: 45149 [2022-11-02 21:08:51,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 21:08:51,191 INFO L413 NwaCegarLoop]: 1893 mSDtfsCounter, 2078 mSDsluCounter, 4800 mSDsCounter, 0 mSdLazyCounter, 4013 mSolverCounterSat, 2163 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 6693 SdHoareTripleChecker+Invalid, 6177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2163 IncrementalHoareTripleChecker+Valid, 4013 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:08:51,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 6693 Invalid, 6177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2163 Valid, 4013 Invalid, 1 Unknown, 0 Unchecked, 12.7s Time] [2022-11-02 21:08:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45149 states. [2022-11-02 21:08:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45149 to 40400. [2022-11-02 21:08:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40400 states, 29009 states have (on average 1.3185907821710503) internal successors, (38251), 29744 states have internal predecessors, (38251), 8654 states have call successors, (8654), 2338 states have call predecessors, (8654), 2736 states have return successors, (10996), 8685 states have call predecessors, (10996), 8648 states have call successors, (10996) [2022-11-02 21:08:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40400 states to 40400 states and 57901 transitions. [2022-11-02 21:08:54,181 INFO L78 Accepts]: Start accepts. Automaton has 40400 states and 57901 transitions. Word has length 206 [2022-11-02 21:08:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:08:54,181 INFO L495 AbstractCegarLoop]: Abstraction has 40400 states and 57901 transitions. [2022-11-02 21:08:54,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (30), 7 states have call predecessors, (30), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 21:08:54,182 INFO L276 IsEmpty]: Start isEmpty. Operand 40400 states and 57901 transitions. [2022-11-02 21:08:54,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-02 21:08:54,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:08:54,216 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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] [2022-11-02 21:08:54,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:08:54,217 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:08:54,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1492256636, now seen corresponding path program 1 times [2022-11-02 21:08:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:54,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232994873] [2022-11-02 21:08:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:08:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:08:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:08:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-02 21:08:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:08:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 21:08:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-11-02 21:08:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-02 21:08:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-02 21:08:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-02 21:08:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-02 21:08:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:08:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:08:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 21:08:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:08:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:08:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-02 21:08:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 21:08:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 21:08:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:08:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-02 21:08:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-02 21:08:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-11-02 21:08:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 21:08:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:08:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 21:08:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-02 21:08:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-11-02 21:08:55,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:55,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232994873] [2022-11-02 21:08:55,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232994873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:55,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:55,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:08:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137336572] [2022-11-02 21:08:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:55,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:08:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:55,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:08:55,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:08:55,015 INFO L87 Difference]: Start difference. First operand 40400 states and 57901 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 3 states have internal predecessors, (110), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 21:08:57,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []