./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--input--touchscreen--usbtouchscreen.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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/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 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f --- 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:11:06,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:11:06,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:11:07,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:11:07,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:11:07,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:11:07,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:11:07,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:11:07,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:11:07,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:11:07,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:11:07,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:11:07,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:11:07,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:11:07,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:11:07,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:11:07,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:11:07,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:11:07,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:11:07,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:11:07,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:11:07,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:11:07,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:11:07,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:11:07,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:11:07,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:11:07,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:11:07,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:11:07,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:11:07,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:11:07,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:11:07,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:11:07,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:11:07,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:11:07,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:11:07,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:11:07,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:11:07,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:11:07,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:11:07,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:11:07,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:11:07,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:11:07,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:11:07,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:11:07,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:11:07,162 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:11:07,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:11:07,163 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:11:07,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:11:07,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:11:07,164 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:11:07,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:11:07,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:11:07,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:11:07,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:11:07,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:11:07,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:11:07,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:11:07,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:11:07,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:11:07,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:11:07,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:11:07,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:11:07,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:07,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:11:07,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:11:07,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:11:07,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:11:07,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:11:07,171 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:11:07,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:11:07,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:11:07,171 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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/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 -> 5c13092b5fe0ffbf7fbf1fe31d493be6a68ca2455b811b10fd7983ff470e432f [2022-11-02 21:11:07,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:11:07,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:11:07,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:11:07,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:11:07,516 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:11:07,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-11-02 21:11:07,585 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/data/3bbc7bba3/c076029e485e4e95bdbdbbf93e987893/FLAGf5036d07a [2022-11-02 21:11:08,451 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:11:08,452 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-11-02 21:11:08,491 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/data/3bbc7bba3/c076029e485e4e95bdbdbbf93e987893/FLAGf5036d07a [2022-11-02 21:11:08,969 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/data/3bbc7bba3/c076029e485e4e95bdbdbbf93e987893 [2022-11-02 21:11:08,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:11:08,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:11:08,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:08,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:11:08,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:11:08,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:08" (1/1) ... [2022-11-02 21:11:08,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b2960a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:08, skipping insertion in model container [2022-11-02 21:11:08,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:11:08" (1/1) ... [2022-11-02 21:11:08,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:11:09,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:11:09,934 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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-11-02 21:11:10,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:10,624 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:11:10,775 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_d345f82b-7ec7-4127-bf90-d6208aa88b7c/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i[108030,108043] [2022-11-02 21:11:11,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:11:11,169 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:11:11,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11 WrapperNode [2022-11-02 21:11:11,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:11:11,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:11,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:11:11,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:11:11,182 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:11:11" (1/1) ... [2022-11-02 21:11:11,280 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:11:11" (1/1) ... [2022-11-02 21:11:11,507 INFO L138 Inliner]: procedures = 178, calls = 1867, calls flagged for inlining = 81, calls inlined = 81, statements flattened = 3540 [2022-11-02 21:11:11,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:11:11,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:11:11,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:11:11,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:11:11,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:11:11,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:11:11,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:11:11,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:11:11,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (1/1) ... [2022-11-02 21:11:11,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:11:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:11:11,948 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:11:11,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d345f82b-7ec7-4127-bf90-d6208aa88b7c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-11-02 21:11:12,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-11-02 21:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 21:11:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2022-11-02 21:11:12,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2022-11-02 21:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2022-11-02 21:11:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2022-11-02 21:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_5 [2022-11-02 21:11:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_5 [2022-11-02 21:11:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_6 [2022-11-02 21:11:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_6 [2022-11-02 21:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 21:11:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 21:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-11-02 21:11:12,007 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-11-02 21:11:12,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:11:12,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_20 [2022-11-02 21:11:12,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_20 [2022-11-02 21:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-11-02 21:11:12,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-11-02 21:11:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 21:11:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 21:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 21:11:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 21:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:11:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:11:12,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-11-02 21:11:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-11-02 21:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 21:11:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 21:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-11-02 21:11:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-11-02 21:11:12,010 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 21:11:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 21:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2022-11-02 21:11:12,011 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2022-11-02 21:11:12,011 INFO L130 BoogieDeclarations]: Found specification of procedure kstrdup [2022-11-02 21:11:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrdup [2022-11-02 21:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-02 21:11:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-02 21:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2022-11-02 21:11:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2022-11-02 21:11:12,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-11-02 21:11:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-11-02 21:11:12,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 21:11:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 21:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-11-02 21:11:12,014 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-11-02 21:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 21:11:12,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 21:11:12,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 21:11:12,015 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 21:11:12,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 21:11:12,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 21:11:12,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:11:12,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-11-02 21:11:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-11-02 21:11:12,018 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_free_buffers [2022-11-02 21:11:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_free_buffers [2022-11-02 21:11:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2022-11-02 21:11:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2022-11-02 21:11:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_22 [2022-11-02 21:11:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_22 [2022-11-02 21:11:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:11:12,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 21:11:12,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 21:11:12,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:11:12,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:11:12,020 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-11-02 21:11:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-11-02 21:11:12,021 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-02 21:11:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-02 21:11:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:11:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 21:11:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 21:11:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 21:11:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:11:12,022 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 21:11:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 21:11:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-11-02 21:11:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-11-02 21:11:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_16 [2022-11-02 21:11:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_16 [2022-11-02 21:11:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2022-11-02 21:11:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2022-11-02 21:11:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2022-11-02 21:11:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2022-11-02 21:11:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:11:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-11-02 21:11:12,025 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-11-02 21:11:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:11:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-11-02 21:11:12,026 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-11-02 21:11:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_open [2022-11-02 21:11:12,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_open [2022-11-02 21:11:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_12 [2022-11-02 21:11:12,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_12 [2022-11-02 21:11:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-02 21:11:12,028 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-02 21:11:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-02 21:11:12,029 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-02 21:11:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 21:11:12,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 21:11:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2022-11-02 21:11:12,029 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2022-11-02 21:11:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-02 21:11:12,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-02 21:11:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2022-11-02 21:11:12,030 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2022-11-02 21:11:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-11-02 21:11:12,030 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-11-02 21:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2022-11-02 21:11:12,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2022-11-02 21:11:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-02 21:11:12,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-02 21:11:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:11:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2022-11-02 21:11:12,035 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2022-11-02 21:11:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-11-02 21:11:12,036 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-11-02 21:11:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 21:11:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 21:11:12,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 21:11:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:11:12,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:11:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-11-02 21:11:12,036 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-11-02 21:11:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2022-11-02 21:11:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2022-11-02 21:11:12,751 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:11:12,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:11:13,098 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:11:16,905 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-11-02 21:11:18,257 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:11:18,280 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:11:18,281 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:11:18,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:18 BoogieIcfgContainer [2022-11-02 21:11:18,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:11:18,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:11:18,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:11:18,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:11:18,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:11:08" (1/3) ... [2022-11-02 21:11:18,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7623d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:18, skipping insertion in model container [2022-11-02 21:11:18,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:11:11" (2/3) ... [2022-11-02 21:11:18,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7623d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:11:18, skipping insertion in model container [2022-11-02 21:11:18,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:11:18" (3/3) ... [2022-11-02 21:11:18,294 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--touchscreen--usbtouchscreen.ko-entry_point.cil.out.i [2022-11-02 21:11:18,314 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:11:18,315 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:11:18,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:11:18,429 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;@7cfafc29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:11:18,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:11:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand has 959 states, 694 states have (on average 1.3530259365994237) internal successors, (939), 713 states have internal predecessors, (939), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) [2022-11-02 21:11:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 21:11:18,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:18,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:11:18,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -528872520, now seen corresponding path program 1 times [2022-11-02 21:11:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:18,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392442271] [2022-11-02 21:11:18,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:18,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:19,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:11:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392442271] [2022-11-02 21:11:19,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392442271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:19,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:19,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416066660] [2022-11-02 21:11:19,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:19,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:19,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:19,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:19,463 INFO L87 Difference]: Start difference. First operand has 959 states, 694 states have (on average 1.3530259365994237) internal successors, (939), 713 states have internal predecessors, (939), 207 states have call successors, (207), 58 states have call predecessors, (207), 56 states have return successors, (201), 199 states have call predecessors, (201), 201 states have call successors, (201) Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:11:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:31,148 INFO L93 Difference]: Finished difference Result 3538 states and 5257 transitions. [2022-11-02 21:11:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-02 21:11:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:31,218 INFO L225 Difference]: With dead ends: 3538 [2022-11-02 21:11:31,218 INFO L226 Difference]: Without dead ends: 2560 [2022-11-02 21:11:31,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:11:31,244 INFO L413 NwaCegarLoop]: 1526 mSDtfsCounter, 3075 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3253 SdHoareTripleChecker+Valid, 3707 SdHoareTripleChecker+Invalid, 3861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1559 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:31,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3253 Valid, 3707 Invalid, 3861 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1559 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2022-11-02 21:11:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2022-11-02 21:11:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 1859. [2022-11-02 21:11:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1355 states have (on average 1.3424354243542436) internal successors, (1819), 1372 states have internal predecessors, (1819), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-11-02 21:11:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2599 transitions. [2022-11-02 21:11:31,530 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2599 transitions. Word has length 28 [2022-11-02 21:11:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:31,531 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 2599 transitions. [2022-11-02 21:11:31,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 21:11:31,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2599 transitions. [2022-11-02 21:11:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 21:11:31,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:31,541 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:11:31,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:11:31,542 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash -118423946, now seen corresponding path program 1 times [2022-11-02 21:11:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:31,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710835966] [2022-11-02 21:11:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:31,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:11:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:31,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:31,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710835966] [2022-11-02 21:11:31,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710835966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:31,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:31,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590466489] [2022-11-02 21:11:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:31,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:31,948 INFO L87 Difference]: Start difference. First operand 1859 states and 2599 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:11:36,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:11:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:39,764 INFO L93 Difference]: Finished difference Result 2583 states and 3724 transitions. [2022-11-02 21:11:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:11:39,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-11-02 21:11:39,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:39,783 INFO L225 Difference]: With dead ends: 2583 [2022-11-02 21:11:39,783 INFO L226 Difference]: Without dead ends: 2570 [2022-11-02 21:11:39,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:39,790 INFO L413 NwaCegarLoop]: 1218 mSDtfsCounter, 2203 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:39,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2259 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-02 21:11:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-11-02 21:11:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 1859. [2022-11-02 21:11:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1355 states have (on average 1.3416974169741698) internal successors, (1818), 1372 states have internal predecessors, (1818), 393 states have call successors, (393), 111 states have call predecessors, (393), 110 states have return successors, (387), 383 states have call predecessors, (387), 387 states have call successors, (387) [2022-11-02 21:11:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2598 transitions. [2022-11-02 21:11:39,924 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2598 transitions. Word has length 38 [2022-11-02 21:11:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:39,925 INFO L495 AbstractCegarLoop]: Abstraction has 1859 states and 2598 transitions. [2022-11-02 21:11:39,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:11:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2598 transitions. [2022-11-02 21:11:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 21:11:39,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:39,937 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:11:39,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:11:39,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash -61165644, now seen corresponding path program 1 times [2022-11-02 21:11:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:39,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044507612] [2022-11-02 21:11:39,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:40,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:11:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:40,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044507612] [2022-11-02 21:11:40,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044507612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:40,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:40,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422703915] [2022-11-02 21:11:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:40,710 INFO L87 Difference]: Start difference. First operand 1859 states and 2598 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:11:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:11:52,453 INFO L93 Difference]: Finished difference Result 6942 states and 10376 transitions. [2022-11-02 21:11:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:11:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-11-02 21:11:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:11:52,495 INFO L225 Difference]: With dead ends: 6942 [2022-11-02 21:11:52,496 INFO L226 Difference]: Without dead ends: 5097 [2022-11-02 21:11:52,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:11:52,516 INFO L413 NwaCegarLoop]: 1455 mSDtfsCounter, 3214 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 3551 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1647 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:11:52,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 3551 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1647 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 11.2s Time] [2022-11-02 21:11:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5097 states. [2022-11-02 21:11:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5097 to 4246. [2022-11-02 21:11:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4246 states, 3099 states have (on average 1.3262342691190707) internal successors, (4110), 3132 states have internal predecessors, (4110), 851 states have call successors, (851), 220 states have call predecessors, (851), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-11-02 21:11:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 6172 transitions. [2022-11-02 21:11:52,840 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 6172 transitions. Word has length 38 [2022-11-02 21:11:52,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:11:52,841 INFO L495 AbstractCegarLoop]: Abstraction has 4246 states and 6172 transitions. [2022-11-02 21:11:52,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:11:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 6172 transitions. [2022-11-02 21:11:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 21:11:52,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:11:52,847 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:11:52,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:11:52,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:11:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:11:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1896633318, now seen corresponding path program 1 times [2022-11-02 21:11:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:11:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74868192] [2022-11-02 21:11:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:11:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:11:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:11:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:11:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:11:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:11:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:11:53,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:11:53,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74868192] [2022-11-02 21:11:53,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74868192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:11:53,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:11:53,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:11:53,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296692546] [2022-11-02 21:11:53,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:11:53,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:11:53,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:11:53,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:11:53,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:11:53,549 INFO L87 Difference]: Start difference. First operand 4246 states and 6172 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:00,322 INFO L93 Difference]: Finished difference Result 5088 states and 7602 transitions. [2022-11-02 21:12:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:12:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-02 21:12:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:00,354 INFO L225 Difference]: With dead ends: 5088 [2022-11-02 21:12:00,355 INFO L226 Difference]: Without dead ends: 5085 [2022-11-02 21:12:00,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:00,359 INFO L413 NwaCegarLoop]: 1177 mSDtfsCounter, 2231 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2357 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:00,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2357 Valid, 2141 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1014 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-02 21:12:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2022-11-02 21:12:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4245. [2022-11-02 21:12:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4245 states, 3099 states have (on average 1.3259115843820588) internal successors, (4109), 3131 states have internal predecessors, (4109), 850 states have call successors, (850), 220 states have call predecessors, (850), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-11-02 21:12:00,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 6170 transitions. [2022-11-02 21:12:00,751 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 6170 transitions. Word has length 39 [2022-11-02 21:12:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:00,752 INFO L495 AbstractCegarLoop]: Abstraction has 4245 states and 6170 transitions. [2022-11-02 21:12:00,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 6170 transitions. [2022-11-02 21:12:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 21:12:00,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:00,754 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:00,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:12:00,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1333415799, now seen corresponding path program 1 times [2022-11-02 21:12:00,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073012633] [2022-11-02 21:12:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:00,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:12:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:12:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:12:01,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:01,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073012633] [2022-11-02 21:12:01,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073012633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:01,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:01,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:12:01,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925196637] [2022-11-02 21:12:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:01,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:12:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:12:01,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:01,015 INFO L87 Difference]: Start difference. First operand 4245 states and 6170 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:07,444 INFO L93 Difference]: Finished difference Result 5087 states and 7600 transitions. [2022-11-02 21:12:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:12:07,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-11-02 21:12:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:07,481 INFO L225 Difference]: With dead ends: 5087 [2022-11-02 21:12:07,481 INFO L226 Difference]: Without dead ends: 5084 [2022-11-02 21:12:07,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:07,487 INFO L413 NwaCegarLoop]: 1181 mSDtfsCounter, 2185 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 997 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2308 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 997 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:07,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2308 Valid, 2178 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [997 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-11-02 21:12:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5084 states. [2022-11-02 21:12:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5084 to 4244. [2022-11-02 21:12:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 3099 states have (on average 1.325588899645047) internal successors, (4108), 3130 states have internal predecessors, (4108), 849 states have call successors, (849), 220 states have call predecessors, (849), 295 states have return successors, (1211), 909 states have call predecessors, (1211), 845 states have call successors, (1211) [2022-11-02 21:12:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 6168 transitions. [2022-11-02 21:12:07,929 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 6168 transitions. Word has length 40 [2022-11-02 21:12:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:07,929 INFO L495 AbstractCegarLoop]: Abstraction has 4244 states and 6168 transitions. [2022-11-02 21:12:07,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:07,930 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 6168 transitions. [2022-11-02 21:12:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 21:12:07,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:07,933 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:07,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:12:07,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:07,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1614271811, now seen corresponding path program 1 times [2022-11-02 21:12:07,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:07,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275752461] [2022-11-02 21:12:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:07,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:12:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:12:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:12:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:08,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275752461] [2022-11-02 21:12:08,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275752461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:08,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:08,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:12:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82259907] [2022-11-02 21:12:08,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:08,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:12:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:12:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:08,222 INFO L87 Difference]: Start difference. First operand 4244 states and 6168 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:11,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:19,534 INFO L93 Difference]: Finished difference Result 14347 states and 21990 transitions. [2022-11-02 21:12:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:12:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-11-02 21:12:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:19,607 INFO L225 Difference]: With dead ends: 14347 [2022-11-02 21:12:19,607 INFO L226 Difference]: Without dead ends: 10117 [2022-11-02 21:12:19,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:12:19,638 INFO L413 NwaCegarLoop]: 1397 mSDtfsCounter, 3104 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 1599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3267 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 3796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1599 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:19,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3267 Valid, 3570 Invalid, 3796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1599 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2022-11-02 21:12:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2022-11-02 21:12:20,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 8695. [2022-11-02 21:12:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8695 states, 6351 states have (on average 1.3254605573925367) internal successors, (8418), 6411 states have internal predecessors, (8418), 1726 states have call successors, (1726), 435 states have call predecessors, (1726), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-11-02 21:12:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8695 states to 8695 states and 13057 transitions. [2022-11-02 21:12:20,486 INFO L78 Accepts]: Start accepts. Automaton has 8695 states and 13057 transitions. Word has length 41 [2022-11-02 21:12:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:20,486 INFO L495 AbstractCegarLoop]: Abstraction has 8695 states and 13057 transitions. [2022-11-02 21:12:20,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 8695 states and 13057 transitions. [2022-11-02 21:12:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 21:12:20,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:20,488 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:20,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:12:20,489 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:20,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1496697658, now seen corresponding path program 1 times [2022-11-02 21:12:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025486588] [2022-11-02 21:12:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:20,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:12:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:20,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:12:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 21:12:20,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:20,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025486588] [2022-11-02 21:12:20,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025486588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:20,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:20,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 21:12:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376346929] [2022-11-02 21:12:20,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:20,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:12:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:12:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:12:20,774 INFO L87 Difference]: Start difference. First operand 8695 states and 13057 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:27,314 INFO L93 Difference]: Finished difference Result 10085 states and 15441 transitions. [2022-11-02 21:12:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:12:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-11-02 21:12:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:27,372 INFO L225 Difference]: With dead ends: 10085 [2022-11-02 21:12:27,373 INFO L226 Difference]: Without dead ends: 10073 [2022-11-02 21:12:27,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:27,379 INFO L413 NwaCegarLoop]: 1166 mSDtfsCounter, 2196 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:27,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 2153 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-11-02 21:12:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10073 states. [2022-11-02 21:12:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10073 to 8685. [2022-11-02 21:12:28,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8685 states, 6342 states have (on average 1.325291706086408) internal successors, (8405), 6401 states have internal predecessors, (8405), 1725 states have call successors, (1725), 435 states have call predecessors, (1725), 617 states have return successors, (2913), 1880 states have call predecessors, (2913), 1719 states have call successors, (2913) [2022-11-02 21:12:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8685 states to 8685 states and 13043 transitions. [2022-11-02 21:12:28,229 INFO L78 Accepts]: Start accepts. Automaton has 8685 states and 13043 transitions. Word has length 42 [2022-11-02 21:12:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:28,230 INFO L495 AbstractCegarLoop]: Abstraction has 8685 states and 13043 transitions. [2022-11-02 21:12:28,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 21:12:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 8685 states and 13043 transitions. [2022-11-02 21:12:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-02 21:12:28,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:28,236 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:28,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:12:28,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1218058086, now seen corresponding path program 1 times [2022-11-02 21:12:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:28,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488917521] [2022-11-02 21:12:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:12:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:12:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-02 21:12:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 21:12:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 21:12:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:12:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 21:12:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:28,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488917521] [2022-11-02 21:12:28,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488917521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:28,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:28,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:28,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198623980] [2022-11-02 21:12:28,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:28,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:28,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:28,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:28,535 INFO L87 Difference]: Start difference. First operand 8685 states and 13043 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:12:34,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:12:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:12:40,193 INFO L93 Difference]: Finished difference Result 21527 states and 33496 transitions. [2022-11-02 21:12:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 21:12:40,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2022-11-02 21:12:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:12:40,283 INFO L225 Difference]: With dead ends: 21527 [2022-11-02 21:12:40,283 INFO L226 Difference]: Without dead ends: 12856 [2022-11-02 21:12:40,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:12:40,334 INFO L413 NwaCegarLoop]: 1234 mSDtfsCounter, 2716 mSDsluCounter, 2780 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 1852 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2839 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1852 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:12:40,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2839 Valid, 4014 Invalid, 4312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1852 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-02 21:12:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12856 states. [2022-11-02 21:12:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12856 to 10655. [2022-11-02 21:12:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10655 states, 7772 states have (on average 1.3117601646937724) internal successors, (10195), 7825 states have internal predecessors, (10195), 2063 states have call successors, (2063), 437 states have call predecessors, (2063), 819 states have return successors, (4329), 2428 states have call predecessors, (4329), 2057 states have call successors, (4329) [2022-11-02 21:12:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10655 states to 10655 states and 16587 transitions. [2022-11-02 21:12:41,326 INFO L78 Accepts]: Start accepts. Automaton has 10655 states and 16587 transitions. Word has length 87 [2022-11-02 21:12:41,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:12:41,326 INFO L495 AbstractCegarLoop]: Abstraction has 10655 states and 16587 transitions. [2022-11-02 21:12:41,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-02 21:12:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10655 states and 16587 transitions. [2022-11-02 21:12:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-02 21:12:41,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:12:41,335 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-02 21:12:41,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:12:41,335 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:12:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:12:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2086848295, now seen corresponding path program 1 times [2022-11-02 21:12:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:12:41,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720759041] [2022-11-02 21:12:41,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:12:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:12:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:12:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:12:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:12:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 21:12:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-02 21:12:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:12:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:12:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 21:12:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:12:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:12:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 21:12:41,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:12:41,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720759041] [2022-11-02 21:12:41,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720759041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:12:41,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:12:41,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:12:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770711748] [2022-11-02 21:12:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:12:41,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:12:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:12:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:12:41,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:12:41,717 INFO L87 Difference]: Start difference. First operand 10655 states and 16587 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:13:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:00,735 INFO L93 Difference]: Finished difference Result 35944 states and 56745 transitions. [2022-11-02 21:13:00,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:13:00,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-11-02 21:13:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:00,883 INFO L225 Difference]: With dead ends: 35944 [2022-11-02 21:13:00,884 INFO L226 Difference]: Without dead ends: 25311 [2022-11-02 21:13:00,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:13:00,949 INFO L413 NwaCegarLoop]: 2100 mSDtfsCounter, 4252 mSDsluCounter, 4008 mSDsCounter, 0 mSdLazyCounter, 4075 mSolverCounterSat, 3532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4427 SdHoareTripleChecker+Valid, 6108 SdHoareTripleChecker+Invalid, 7607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3532 IncrementalHoareTripleChecker+Valid, 4075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:00,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4427 Valid, 6108 Invalid, 7607 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3532 Valid, 4075 Invalid, 0 Unknown, 0 Unchecked, 16.8s Time] [2022-11-02 21:13:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25311 states. [2022-11-02 21:13:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25311 to 20937. [2022-11-02 21:13:02,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20937 states, 15252 states have (on average 1.3081563073695253) internal successors, (19952), 15355 states have internal predecessors, (19952), 4053 states have call successors, (4053), 865 states have call predecessors, (4053), 1631 states have return successors, (8423), 4788 states have call predecessors, (8423), 4047 states have call successors, (8423) [2022-11-02 21:13:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20937 states to 20937 states and 32428 transitions. [2022-11-02 21:13:02,933 INFO L78 Accepts]: Start accepts. Automaton has 20937 states and 32428 transitions. Word has length 112 [2022-11-02 21:13:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:02,933 INFO L495 AbstractCegarLoop]: Abstraction has 20937 states and 32428 transitions. [2022-11-02 21:13:02,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-02 21:13:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 20937 states and 32428 transitions. [2022-11-02 21:13:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 21:13:02,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:02,943 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:13:02,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:13:02,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:02,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:02,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1479920862, now seen corresponding path program 1 times [2022-11-02 21:13:02,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:02,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548509499] [2022-11-02 21:13:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:02,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:13:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:13:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:13:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:13:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 21:13:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-02 21:13:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:13:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 21:13:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:13:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:13:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 21:13:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:03,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548509499] [2022-11-02 21:13:03,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548509499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:03,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:03,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:13:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288770052] [2022-11-02 21:13:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:03,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:13:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:03,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:13:03,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:13:03,704 INFO L87 Difference]: Start difference. First operand 20937 states and 32428 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 21:13:07,647 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:13:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:13:28,288 INFO L93 Difference]: Finished difference Result 61259 states and 96621 transitions. [2022-11-02 21:13:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 21:13:28,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2022-11-02 21:13:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:13:28,520 INFO L225 Difference]: With dead ends: 61259 [2022-11-02 21:13:28,520 INFO L226 Difference]: Without dead ends: 40344 [2022-11-02 21:13:28,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-11-02 21:13:28,619 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 4582 mSDsluCounter, 5146 mSDsCounter, 0 mSdLazyCounter, 5294 mSolverCounterSat, 3528 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4791 SdHoareTripleChecker+Valid, 7417 SdHoareTripleChecker+Invalid, 8823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3528 IncrementalHoareTripleChecker+Valid, 5294 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:13:28,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4791 Valid, 7417 Invalid, 8823 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3528 Valid, 5294 Invalid, 1 Unknown, 0 Unchecked, 20.5s Time] [2022-11-02 21:13:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40344 states. [2022-11-02 21:13:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40344 to 31339. [2022-11-02 21:13:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31339 states, 22816 states have (on average 1.3071967040673211) internal successors, (29825), 22981 states have internal predecessors, (29825), 6055 states have call successors, (6055), 1293 states have call predecessors, (6055), 2467 states have return successors, (12553), 7172 states have call predecessors, (12553), 6049 states have call successors, (12553) [2022-11-02 21:13:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31339 states to 31339 states and 48433 transitions. [2022-11-02 21:13:31,917 INFO L78 Accepts]: Start accepts. Automaton has 31339 states and 48433 transitions. Word has length 139 [2022-11-02 21:13:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:13:31,917 INFO L495 AbstractCegarLoop]: Abstraction has 31339 states and 48433 transitions. [2022-11-02 21:13:31,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 7 states have call predecessors, (20), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 21:13:31,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31339 states and 48433 transitions. [2022-11-02 21:13:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 21:13:31,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:13:31,931 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 21:13:31,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:13:31,931 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:13:31,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:13:31,932 INFO L85 PathProgramCache]: Analyzing trace with hash -98138694, now seen corresponding path program 1 times [2022-11-02 21:13:31,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:13:31,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922975951] [2022-11-02 21:13:31,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:13:31,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:13:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:13:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:13:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:13:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:13:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-02 21:13:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 21:13:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 21:13:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 21:13:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-11-02 21:13:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 21:13:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:13:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:13:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:13:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:13:32,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:13:32,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922975951] [2022-11-02 21:13:32,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922975951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:13:32,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:13:32,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:13:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315204105] [2022-11-02 21:13:32,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:13:32,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:13:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:13:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:13:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:13:32,629 INFO L87 Difference]: Start difference. First operand 31339 states and 48433 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:13:38,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-02 21:14:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:14:21,740 INFO L93 Difference]: Finished difference Result 114846 states and 200732 transitions. [2022-11-02 21:14:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-02 21:14:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2022-11-02 21:14:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:14:22,522 INFO L225 Difference]: With dead ends: 114846 [2022-11-02 21:14:22,523 INFO L226 Difference]: Without dead ends: 83529 [2022-11-02 21:14:22,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2022-11-02 21:14:22,652 INFO L413 NwaCegarLoop]: 2386 mSDtfsCounter, 8622 mSDsluCounter, 11473 mSDsCounter, 0 mSdLazyCounter, 15112 mSolverCounterSat, 9629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8833 SdHoareTripleChecker+Valid, 13859 SdHoareTripleChecker+Invalid, 24741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 9629 IncrementalHoareTripleChecker+Valid, 15112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:14:22,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8833 Valid, 13859 Invalid, 24741 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [9629 Valid, 15112 Invalid, 0 Unknown, 0 Unchecked, 38.5s Time] [2022-11-02 21:14:22,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83529 states. [2022-11-02 21:14:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83529 to 34197. [2022-11-02 21:14:27,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34197 states, 24724 states have (on average 1.3036320983659602) internal successors, (32231), 24799 states have internal predecessors, (32231), 6865 states have call successors, (6865), 1293 states have call predecessors, (6865), 2607 states have return successors, (14493), 8224 states have call predecessors, (14493), 6859 states have call successors, (14493) [2022-11-02 21:14:27,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34197 states to 34197 states and 53589 transitions. [2022-11-02 21:14:27,884 INFO L78 Accepts]: Start accepts. Automaton has 34197 states and 53589 transitions. Word has length 139 [2022-11-02 21:14:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:14:27,884 INFO L495 AbstractCegarLoop]: Abstraction has 34197 states and 53589 transitions. [2022-11-02 21:14:27,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:14:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34197 states and 53589 transitions. [2022-11-02 21:14:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-11-02 21:14:27,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:14:27,894 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-11-02 21:14:27,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:14:27,894 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:14:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:14:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2075886927, now seen corresponding path program 1 times [2022-11-02 21:14:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:14:27,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934044328] [2022-11-02 21:14:27,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:14:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:14:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:14:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-11-02 21:14:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:14:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 21:14:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:14:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 21:14:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 21:14:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 21:14:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 21:14:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 21:14:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 21:14:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:14:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:14:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 21:14:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:14:28,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934044328] [2022-11-02 21:14:28,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934044328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:14:28,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:14:28,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:14:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409153760] [2022-11-02 21:14:28,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:14:28,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:14:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:14:28,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:14:28,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:14:28,726 INFO L87 Difference]: Start difference. First operand 34197 states and 53589 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (19), 9 states have call predecessors, (19), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:14:48,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []