./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--net--usb--ipheth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/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_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/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_081e100c-307f-48f9-b718-8520c36c5f64/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 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:51:37,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:37,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:37,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:37,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:37,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:37,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:37,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:37,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:37,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:37,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:37,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:37,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:37,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:37,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:37,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:37,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:37,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:37,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:37,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:37,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:37,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:37,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:37,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:37,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:37,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:37,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:37,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:37,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:37,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:37,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:37,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:37,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:37,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:37,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:37,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:37,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:37,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:37,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:37,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:37,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:37,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 20:51:37,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:37,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:37,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:37,341 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:37,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:37,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:37,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:37,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:37,343 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:37,344 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:37,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:37,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:37,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:37,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:37,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:37,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:37,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:37,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:37,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:37,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:37,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:37,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:37,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:37,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:37,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:37,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:37,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:37,349 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:37,349 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:37,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:37,349 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_081e100c-307f-48f9-b718-8520c36c5f64/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_081e100c-307f-48f9-b718-8520c36c5f64/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 -> 1a07d05bdda9164d6ceaf1185c6dc5dd43200f7171a99953930c3f9edfac2ac7 [2022-11-02 20:51:37,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:37,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:37,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:37,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:37,725 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:37,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-11-02 20:51:37,797 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/data/8794037cd/93a86f76a62549b58e7f2ec672a5fed9/FLAG5489f54cd [2022-11-02 20:51:38,696 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:38,696 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-11-02 20:51:38,729 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/data/8794037cd/93a86f76a62549b58e7f2ec672a5fed9/FLAG5489f54cd [2022-11-02 20:51:38,812 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/data/8794037cd/93a86f76a62549b58e7f2ec672a5fed9 [2022-11-02 20:51:38,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:38,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:38,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:38,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:38,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:38,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:38" (1/1) ... [2022-11-02 20:51:38,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168f7813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:38, skipping insertion in model container [2022-11-02 20:51:38,824 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:38" (1/1) ... [2022-11-02 20:51:38,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:38,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:39,912 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_081e100c-307f-48f9-b718-8520c36c5f64/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-11-02 20:51:40,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:40,495 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:40,635 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_081e100c-307f-48f9-b718-8520c36c5f64/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i[159689,159702] [2022-11-02 20:51:40,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:40,883 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:40,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40 WrapperNode [2022-11-02 20:51:40,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:40,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:40,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:40,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:40,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:40,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,063 INFO L138 Inliner]: procedures = 165, calls = 691, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1770 [2022-11-02 20:51:41,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:41,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:41,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:41,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:41,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,221 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,298 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:41,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:41,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:41,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:41,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (1/1) ... [2022-11-02 20:51:41,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:41,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:41,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:41,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2022-11-02 20:51:41,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2022-11-02 20:51:41,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 20:51:41,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_8 [2022-11-02 20:51:41,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_8 [2022-11-02 20:51:41,378 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rx_submit [2022-11-02 20:51:41,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rx_submit [2022-11-02 20:51:41,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_9 [2022-11-02 20:51:41,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_9 [2022-11-02 20:51:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 20:51:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 20:51:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 20:51:41,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 20:51:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:51:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-02 20:51:41,379 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-02 20:51:41,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-11-02 20:51:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-11-02 20:51:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_rcvbulk_callback [2022-11-02 20:51:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_rcvbulk_callback [2022-11-02 20:51:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-02 20:51:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-02 20:51:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-11-02 20:51:41,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-11-02 20:51:41,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 20:51:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 20:51:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 20:51:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 20:51:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 20:51:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 20:51:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-11-02 20:51:41,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-11-02 20:51:41,381 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 20:51:41,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 20:51:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 20:51:41,382 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 20:51:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_disconnect [2022-11-02 20:51:41,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_disconnect [2022-11-02 20:51:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_tx_timeout [2022-11-02 20:51:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_tx_timeout [2022-11-02 20:51:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-02 20:51:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-02 20:51:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 20:51:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 20:51:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-02 20:51:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-02 20:51:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_carrier_set [2022-11-02 20:51:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_carrier_set [2022-11-02 20:51:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-02 20:51:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-02 20:51:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:51:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-11-02 20:51:41,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-11-02 20:51:41,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 20:51:41,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 20:51:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure ipheth_free_urbs [2022-11-02 20:51:41,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ipheth_free_urbs [2022-11-02 20:51:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:41,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:51:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:51:41,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-02 20:51:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-02 20:51:41,389 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-02 20:51:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2022-11-02 20:51:41,389 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2022-11-02 20:51:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:51:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 20:51:41,390 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 20:51:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:51:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_delayed_work [2022-11-02 20:51:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_delayed_work [2022-11-02 20:51:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-02 20:51:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-02 20:51:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-02 20:51:41,391 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-02 20:51:41,391 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-11-02 20:51:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-11-02 20:51:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure round_jiffies_relative [2022-11-02 20:51:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure round_jiffies_relative [2022-11-02 20:51:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 20:51:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 20:51:41,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 20:51:41,392 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-11-02 20:51:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-11-02 20:51:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:41,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:41,935 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:41,939 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:42,163 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 20:51:42,638 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-11-02 20:51:43,536 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:43,555 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:43,556 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:51:43,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:43 BoogieIcfgContainer [2022-11-02 20:51:43,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:43,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:43,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:43,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:43,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:38" (1/3) ... [2022-11-02 20:51:43,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@986ee97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:43, skipping insertion in model container [2022-11-02 20:51:43,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:40" (2/3) ... [2022-11-02 20:51:43,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@986ee97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:43, skipping insertion in model container [2022-11-02 20:51:43,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:43" (3/3) ... [2022-11-02 20:51:43,577 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--usb--ipheth.ko-entry_point.cil.out.i [2022-11-02 20:51:43,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:43,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:51:43,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:43,702 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;@2210812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:43,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:51:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) [2022-11-02 20:51:43,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:51:43,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:43,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:43,728 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -60987296, now seen corresponding path program 1 times [2022-11-02 20:51:43,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:43,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404788558] [2022-11-02 20:51:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:43,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:51:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:44,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404788558] [2022-11-02 20:51:44,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404788558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:44,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:44,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:44,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49818304] [2022-11-02 20:51:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:44,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:44,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:44,453 INFO L87 Difference]: Start difference. First operand has 527 states, 386 states have (on average 1.3031088082901554) internal successors, (503), 405 states have internal predecessors, (503), 104 states have call successors, (104), 37 states have call predecessors, (104), 35 states have return successors, (97), 94 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 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 20:51:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:46,237 INFO L93 Difference]: Finished difference Result 1626 states and 2252 transitions. [2022-11-02 20:51:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:46,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 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 34 [2022-11-02 20:51:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:46,276 INFO L225 Difference]: With dead ends: 1626 [2022-11-02 20:51:46,276 INFO L226 Difference]: Without dead ends: 1080 [2022-11-02 20:51:46,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:46,293 INFO L413 NwaCegarLoop]: 717 mSDtfsCounter, 965 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:46,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1465 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:51:46,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2022-11-02 20:51:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 992. [2022-11-02 20:51:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2764227642276422) internal successors, (942), 754 states have internal predecessors, (942), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2022-11-02 20:51:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1307 transitions. [2022-11-02 20:51:46,479 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1307 transitions. Word has length 34 [2022-11-02 20:51:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:46,480 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1307 transitions. [2022-11-02 20:51:46,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 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 20:51:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1307 transitions. [2022-11-02 20:51:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:51:46,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:46,484 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:46,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:46,484 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash -406405667, now seen corresponding path program 1 times [2022-11-02 20:51:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:46,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873908249] [2022-11-02 20:51:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:46,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:46,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873908249] [2022-11-02 20:51:46,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873908249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:46,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:46,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330198671] [2022-11-02 20:51:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:46,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:46,707 INFO L87 Difference]: Start difference. First operand 992 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:47,539 INFO L93 Difference]: Finished difference Result 1106 states and 1483 transitions. [2022-11-02 20:51:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:47,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-11-02 20:51:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:47,551 INFO L225 Difference]: With dead ends: 1106 [2022-11-02 20:51:47,551 INFO L226 Difference]: Without dead ends: 1093 [2022-11-02 20:51:47,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:47,559 INFO L413 NwaCegarLoop]: 641 mSDtfsCounter, 799 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:47,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 933 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:51:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2022-11-02 20:51:47,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 992. [2022-11-02 20:51:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 738 states have (on average 1.2750677506775068) internal successors, (941), 754 states have internal predecessors, (941), 185 states have call successors, (185), 69 states have call predecessors, (185), 68 states have return successors, (180), 174 states have call predecessors, (180), 180 states have call successors, (180) [2022-11-02 20:51:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1306 transitions. [2022-11-02 20:51:47,664 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1306 transitions. Word has length 44 [2022-11-02 20:51:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:47,665 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1306 transitions. [2022-11-02 20:51:47,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1306 transitions. [2022-11-02 20:51:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-02 20:51:47,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:47,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:47,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:47,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -349147365, now seen corresponding path program 1 times [2022-11-02 20:51:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:47,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474626831] [2022-11-02 20:51:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:47,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:48,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:48,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474626831] [2022-11-02 20:51:48,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474626831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:48,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:48,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:48,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391051968] [2022-11-02 20:51:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:48,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:48,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:48,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:48,100 INFO L87 Difference]: Start difference. First operand 992 states and 1306 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:49,879 INFO L93 Difference]: Finished difference Result 3133 states and 4280 transitions. [2022-11-02 20:51:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:51:49,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-11-02 20:51:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:49,910 INFO L225 Difference]: With dead ends: 3133 [2022-11-02 20:51:49,910 INFO L226 Difference]: Without dead ends: 2150 [2022-11-02 20:51:49,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:49,923 INFO L413 NwaCegarLoop]: 728 mSDtfsCounter, 970 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:49,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1473 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:51:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-11-02 20:51:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 2000. [2022-11-02 20:51:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1487 states have (on average 1.2703429724277069) internal successors, (1889), 1519 states have internal predecessors, (1889), 366 states have call successors, (366), 137 states have call predecessors, (366), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-11-02 20:51:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2670 transitions. [2022-11-02 20:51:50,079 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2670 transitions. Word has length 44 [2022-11-02 20:51:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:50,080 INFO L495 AbstractCegarLoop]: Abstraction has 2000 states and 2670 transitions. [2022-11-02 20:51:50,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2670 transitions. [2022-11-02 20:51:50,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:51:50,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:50,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:50,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:50,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:50,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2061086592, now seen corresponding path program 1 times [2022-11-02 20:51:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:50,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067191040] [2022-11-02 20:51:50,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:50,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:50,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:50,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:50,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067191040] [2022-11-02 20:51:50,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067191040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:50,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:50,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:50,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830449369] [2022-11-02 20:51:50,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:50,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:50,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:50,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:50,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:50,515 INFO L87 Difference]: Start difference. First operand 2000 states and 2670 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:51,371 INFO L93 Difference]: Finished difference Result 2142 states and 2912 transitions. [2022-11-02 20:51:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:51:51,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-11-02 20:51:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:51,386 INFO L225 Difference]: With dead ends: 2142 [2022-11-02 20:51:51,386 INFO L226 Difference]: Without dead ends: 2139 [2022-11-02 20:51:51,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:51,391 INFO L413 NwaCegarLoop]: 623 mSDtfsCounter, 776 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:51,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 889 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:51:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2022-11-02 20:51:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1999. [2022-11-02 20:51:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1999 states, 1487 states have (on average 1.269670477471419) internal successors, (1888), 1518 states have internal predecessors, (1888), 365 states have call successors, (365), 137 states have call predecessors, (365), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-11-02 20:51:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2668 transitions. [2022-11-02 20:51:51,567 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2668 transitions. Word has length 45 [2022-11-02 20:51:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:51,567 INFO L495 AbstractCegarLoop]: Abstraction has 1999 states and 2668 transitions. [2022-11-02 20:51:51,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2668 transitions. [2022-11-02 20:51:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:51:51,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:51,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:51,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:51,570 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -531067202, now seen corresponding path program 1 times [2022-11-02 20:51:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:51,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538562620] [2022-11-02 20:51:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:51,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538562620] [2022-11-02 20:51:51,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538562620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:51,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:51,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287922292] [2022-11-02 20:51:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:51,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:51,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:51,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:51,795 INFO L87 Difference]: Start difference. First operand 1999 states and 2668 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:52,612 INFO L93 Difference]: Finished difference Result 2141 states and 2910 transitions. [2022-11-02 20:51:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:51:52,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-11-02 20:51:52,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:52,624 INFO L225 Difference]: With dead ends: 2141 [2022-11-02 20:51:52,625 INFO L226 Difference]: Without dead ends: 2138 [2022-11-02 20:51:52,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:52,627 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 774 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:52,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 883 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:51:52,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2022-11-02 20:51:52,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1998. [2022-11-02 20:51:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1487 states have (on average 1.2689979825151312) internal successors, (1887), 1517 states have internal predecessors, (1887), 364 states have call successors, (364), 137 states have call predecessors, (364), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-11-02 20:51:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2666 transitions. [2022-11-02 20:51:52,822 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2666 transitions. Word has length 46 [2022-11-02 20:51:52,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:52,822 INFO L495 AbstractCegarLoop]: Abstraction has 1998 states and 2666 transitions. [2022-11-02 20:51:52,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2666 transitions. [2022-11-02 20:51:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-02 20:51:52,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:52,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:52,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:52,829 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 716548675, now seen corresponding path program 1 times [2022-11-02 20:51:52,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805742709] [2022-11-02 20:51:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:52,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:53,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:53,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805742709] [2022-11-02 20:51:53,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805742709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:53,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:53,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800111901] [2022-11-02 20:51:53,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:53,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:53,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:53,028 INFO L87 Difference]: Start difference. First operand 1998 states and 2666 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:53,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:53,871 INFO L93 Difference]: Finished difference Result 2140 states and 2908 transitions. [2022-11-02 20:51:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:51:53,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-11-02 20:51:53,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:53,888 INFO L225 Difference]: With dead ends: 2140 [2022-11-02 20:51:53,888 INFO L226 Difference]: Without dead ends: 2137 [2022-11-02 20:51:53,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:53,891 INFO L413 NwaCegarLoop]: 619 mSDtfsCounter, 770 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:53,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 883 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:51:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2022-11-02 20:51:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1997. [2022-11-02 20:51:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1487 states have (on average 1.2683254875588432) internal successors, (1886), 1516 states have internal predecessors, (1886), 363 states have call successors, (363), 137 states have call predecessors, (363), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-11-02 20:51:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2664 transitions. [2022-11-02 20:51:54,068 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2664 transitions. Word has length 47 [2022-11-02 20:51:54,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:54,069 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2664 transitions. [2022-11-02 20:51:54,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2664 transitions. [2022-11-02 20:51:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:51:54,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:54,070 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:54,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:54,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:54,072 INFO L85 PathProgramCache]: Analyzing trace with hash 737940065, now seen corresponding path program 1 times [2022-11-02 20:51:54,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:54,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670931987] [2022-11-02 20:51:54,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:54,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:51:54,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:54,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670931987] [2022-11-02 20:51:54,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670931987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:54,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:54,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:51:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606048571] [2022-11-02 20:51:54,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:54,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:51:54,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:51:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:51:54,218 INFO L87 Difference]: Start difference. First operand 1997 states and 2664 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:55,059 INFO L93 Difference]: Finished difference Result 2139 states and 2906 transitions. [2022-11-02 20:51:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:51:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-02 20:51:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:55,072 INFO L225 Difference]: With dead ends: 2139 [2022-11-02 20:51:55,073 INFO L226 Difference]: Without dead ends: 2127 [2022-11-02 20:51:55,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:51:55,076 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 767 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:55,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 882 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:51:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2022-11-02 20:51:55,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1987. [2022-11-02 20:51:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1478 states have (on average 1.2679296346414073) internal successors, (1874), 1506 states have internal predecessors, (1874), 362 states have call successors, (362), 137 states have call predecessors, (362), 146 states have return successors, (415), 355 states have call predecessors, (415), 361 states have call successors, (415) [2022-11-02 20:51:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2651 transitions. [2022-11-02 20:51:55,255 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2651 transitions. Word has length 48 [2022-11-02 20:51:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:55,255 INFO L495 AbstractCegarLoop]: Abstraction has 1987 states and 2651 transitions. [2022-11-02 20:51:55,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-02 20:51:55,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2651 transitions. [2022-11-02 20:51:55,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-02 20:51:55,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:55,268 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:55,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:55,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1153772682, now seen corresponding path program 1 times [2022-11-02 20:51:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:55,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893631904] [2022-11-02 20:51:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:55,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 20:51:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:51:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:51:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-02 20:51:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 20:51:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-02 20:51:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:51:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:51:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:51:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:51:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-02 20:51:55,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:55,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893631904] [2022-11-02 20:51:55,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893631904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:55,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:55,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:55,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669769117] [2022-11-02 20:51:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:55,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:55,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:55,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:55,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:55,658 INFO L87 Difference]: Start difference. First operand 1987 states and 2651 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:51:57,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:57,665 INFO L93 Difference]: Finished difference Result 5900 states and 7924 transitions. [2022-11-02 20:51:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:51:57,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2022-11-02 20:51:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:57,686 INFO L225 Difference]: With dead ends: 5900 [2022-11-02 20:51:57,687 INFO L226 Difference]: Without dead ends: 3922 [2022-11-02 20:51:57,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:57,696 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 1540 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 847 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 847 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:57,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1579 Valid, 1760 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [847 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:51:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-11-02 20:51:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3516. [2022-11-02 20:51:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 2593 states have (on average 1.261473197069032) internal successors, (3271), 2651 states have internal predecessors, (3271), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-11-02 20:51:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4670 transitions. [2022-11-02 20:51:58,140 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4670 transitions. Word has length 153 [2022-11-02 20:51:58,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:58,140 INFO L495 AbstractCegarLoop]: Abstraction has 3516 states and 4670 transitions. [2022-11-02 20:51:58,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:51:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4670 transitions. [2022-11-02 20:51:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 20:51:58,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:58,150 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:58,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:58,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:58,151 INFO L85 PathProgramCache]: Analyzing trace with hash 425318257, now seen corresponding path program 1 times [2022-11-02 20:51:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:58,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078839961] [2022-11-02 20:51:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:51:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:51:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:51:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:51:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:51:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:51:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:51:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:51:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:51:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:51:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:51:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:51:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:51:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:51:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:51:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,490 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:51:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078839961] [2022-11-02 20:51:58,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078839961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:58,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:58,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675618743] [2022-11-02 20:51:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:58,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:58,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:58,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:58,493 INFO L87 Difference]: Start difference. First operand 3516 states and 4670 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:51:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:59,928 INFO L93 Difference]: Finished difference Result 7416 states and 9930 transitions. [2022-11-02 20:51:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-11-02 20:51:59,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:59,952 INFO L225 Difference]: With dead ends: 7416 [2022-11-02 20:51:59,952 INFO L226 Difference]: Without dead ends: 3916 [2022-11-02 20:51:59,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:59,964 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 867 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:59,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 1379 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:51:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2022-11-02 20:52:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3520. [2022-11-02 20:52:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2597 states have (on average 1.261070465922218) internal successors, (3275), 2655 states have internal predecessors, (3275), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-11-02 20:52:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4674 transitions. [2022-11-02 20:52:00,334 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4674 transitions. Word has length 162 [2022-11-02 20:52:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:00,336 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4674 transitions. [2022-11-02 20:52:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:52:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4674 transitions. [2022-11-02 20:52:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 20:52:00,346 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:00,346 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:00,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:52:00,347 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash -632519821, now seen corresponding path program 1 times [2022-11-02 20:52:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:00,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180949060] [2022-11-02 20:52:00,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:00,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:52:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:52:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:52:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:52:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:52:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:52:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:52:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:52:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:52:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:52:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:00,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180949060] [2022-11-02 20:52:00,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180949060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:00,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996308728] [2022-11-02 20:52:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:00,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:00,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:00,894 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:00,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:52:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:01,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:52:01,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:52:01,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996308728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:01,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:01,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-02 20:52:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000841104] [2022-11-02 20:52:01,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:01,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:01,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:01,678 INFO L87 Difference]: Start difference. First operand 3520 states and 4674 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:52:02,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:02,522 INFO L93 Difference]: Finished difference Result 9962 states and 13915 transitions. [2022-11-02 20:52:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:02,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 162 [2022-11-02 20:52:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:02,560 INFO L225 Difference]: With dead ends: 9962 [2022-11-02 20:52:02,560 INFO L226 Difference]: Without dead ends: 6458 [2022-11-02 20:52:02,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:52:02,574 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 852 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:02,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 3869 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:52:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2022-11-02 20:52:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 3532. [2022-11-02 20:52:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3532 states, 2609 states have (on average 1.2598696818704485) internal successors, (3287), 2667 states have internal predecessors, (3287), 625 states have call successors, (625), 258 states have call predecessors, (625), 297 states have return successors, (774), 626 states have call predecessors, (774), 624 states have call successors, (774) [2022-11-02 20:52:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4686 transitions. [2022-11-02 20:52:03,031 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4686 transitions. Word has length 162 [2022-11-02 20:52:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:03,031 INFO L495 AbstractCegarLoop]: Abstraction has 3532 states and 4686 transitions. [2022-11-02 20:52:03,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:52:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4686 transitions. [2022-11-02 20:52:03,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-02 20:52:03,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:03,042 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:03,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:03,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:52:03,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash 625799758, now seen corresponding path program 1 times [2022-11-02 20:52:03,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:03,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419116624] [2022-11-02 20:52:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:52:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:52:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:52:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:52:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:52:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:52:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:52:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:52:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:52:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:52:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 20:52:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 20:52:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:52:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:03,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419116624] [2022-11-02 20:52:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419116624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095540644] [2022-11-02 20:52:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:03,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:03,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:52:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 2118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:52:04,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:52:04,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:04,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095540644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:04,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:04,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-11-02 20:52:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564877981] [2022-11-02 20:52:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:04,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:04,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:04,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:52:04,530 INFO L87 Difference]: Start difference. First operand 3532 states and 4686 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:52:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:06,579 INFO L93 Difference]: Finished difference Result 14900 states and 20710 transitions. [2022-11-02 20:52:06,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:52:06,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2022-11-02 20:52:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:06,645 INFO L225 Difference]: With dead ends: 14900 [2022-11-02 20:52:06,645 INFO L226 Difference]: Without dead ends: 11384 [2022-11-02 20:52:06,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:52:06,659 INFO L413 NwaCegarLoop]: 1728 mSDtfsCounter, 1640 mSDsluCounter, 5450 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:06,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 7178 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:52:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11384 states. [2022-11-02 20:52:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11384 to 7096. [2022-11-02 20:52:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7096 states, 5241 states have (on average 1.2577752337340202) internal successors, (6592), 5365 states have internal predecessors, (6592), 1261 states have call successors, (1261), 514 states have call predecessors, (1261), 593 states have return successors, (1560), 1256 states have call predecessors, (1560), 1260 states have call successors, (1560) [2022-11-02 20:52:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 9413 transitions. [2022-11-02 20:52:07,650 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 9413 transitions. Word has length 172 [2022-11-02 20:52:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:07,651 INFO L495 AbstractCegarLoop]: Abstraction has 7096 states and 9413 transitions. [2022-11-02 20:52:07,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:52:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 9413 transitions. [2022-11-02 20:52:07,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-02 20:52:07,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:07,671 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:07,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:07,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:52:07,899 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash -385317492, now seen corresponding path program 1 times [2022-11-02 20:52:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:07,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147410603] [2022-11-02 20:52:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:52:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:52:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:52:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-02 20:52:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-02 20:52:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:52:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:52:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:52:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 20:52:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:52:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-02 20:52:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 20:52:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-02 20:52:08,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:08,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147410603] [2022-11-02 20:52:08,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147410603] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:08,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399895156] [2022-11-02 20:52:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:08,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:08,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:08,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:08,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:52:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:09,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 2113 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:52:09,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:09,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:09,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:52:09,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:52:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:52:09,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:09,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399895156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:09,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:09,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2022-11-02 20:52:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553186952] [2022-11-02 20:52:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:52:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:52:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:52:09,823 INFO L87 Difference]: Start difference. First operand 7096 states and 9413 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:52:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:14,996 INFO L93 Difference]: Finished difference Result 16712 states and 22395 transitions. [2022-11-02 20:52:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:52:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 172 [2022-11-02 20:52:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:15,034 INFO L225 Difference]: With dead ends: 16712 [2022-11-02 20:52:15,034 INFO L226 Difference]: Without dead ends: 9632 [2022-11-02 20:52:15,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:52:15,056 INFO L413 NwaCegarLoop]: 1010 mSDtfsCounter, 669 mSDsluCounter, 4584 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 3739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:15,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 5594 Invalid, 3739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 20:52:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9632 states. [2022-11-02 20:52:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9632 to 8652. [2022-11-02 20:52:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8652 states, 6423 states have (on average 1.2665421142768176) internal successors, (8135), 6573 states have internal predecessors, (8135), 1497 states have call successors, (1497), 645 states have call predecessors, (1497), 731 states have return successors, (1863), 1473 states have call predecessors, (1863), 1496 states have call successors, (1863) [2022-11-02 20:52:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 11495 transitions. [2022-11-02 20:52:16,090 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 11495 transitions. Word has length 172 [2022-11-02 20:52:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:16,091 INFO L495 AbstractCegarLoop]: Abstraction has 8652 states and 11495 transitions. [2022-11-02 20:52:16,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 8 states have internal predecessors, (120), 2 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 20:52:16,091 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 11495 transitions. [2022-11-02 20:52:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-02 20:52:16,112 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:16,112 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:16,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:16,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:16,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:16,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1960940060, now seen corresponding path program 1 times [2022-11-02 20:52:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093756255] [2022-11-02 20:52:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:52:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 20:52:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 20:52:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-02 20:52:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:52:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-02 20:52:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 20:52:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:52:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 20:52:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:52:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-02 20:52:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:52:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-02 20:52:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:17,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093756255] [2022-11-02 20:52:17,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093756255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:17,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074592962] [2022-11-02 20:52:17,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:17,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:17,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:52:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-02 20:52:17,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:18,265 INFO L356 Elim1Store]: treesize reduction 81, result has 25.7 percent of original size [2022-11-02 20:52:18,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2022-11-02 20:52:18,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:52:18,589 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:52:18,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:52:18,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:52:18,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:52:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:52:18,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:19,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074592962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:19,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:19,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 22 [2022-11-02 20:52:19,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907850982] [2022-11-02 20:52:19,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:19,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:52:19,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:19,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:52:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2022-11-02 20:52:19,169 INFO L87 Difference]: Start difference. First operand 8652 states and 11495 transitions. Second operand has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) [2022-11-02 20:52:27,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:27,814 INFO L93 Difference]: Finished difference Result 21557 states and 29035 transitions. [2022-11-02 20:52:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-02 20:52:27,815 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) Word has length 178 [2022-11-02 20:52:27,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:27,873 INFO L225 Difference]: With dead ends: 21557 [2022-11-02 20:52:27,873 INFO L226 Difference]: Without dead ends: 13589 [2022-11-02 20:52:27,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=400, Invalid=2906, Unknown=0, NotChecked=0, Total=3306 [2022-11-02 20:52:27,900 INFO L413 NwaCegarLoop]: 735 mSDtfsCounter, 2274 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 6567 mSolverCounterSat, 1408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2310 SdHoareTripleChecker+Valid, 7210 SdHoareTripleChecker+Invalid, 7975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1408 IncrementalHoareTripleChecker+Valid, 6567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:27,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2310 Valid, 7210 Invalid, 7975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1408 Valid, 6567 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-02 20:52:27,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13589 states. [2022-11-02 20:52:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13589 to 10664. [2022-11-02 20:52:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10664 states, 7962 states have (on average 1.277945239889475) internal successors, (10175), 8147 states have internal predecessors, (10175), 1808 states have call successors, (1808), 811 states have call predecessors, (1808), 893 states have return successors, (2200), 1745 states have call predecessors, (2200), 1807 states have call successors, (2200) [2022-11-02 20:52:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10664 states to 10664 states and 14183 transitions. [2022-11-02 20:52:29,610 INFO L78 Accepts]: Start accepts. Automaton has 10664 states and 14183 transitions. Word has length 178 [2022-11-02 20:52:29,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:29,611 INFO L495 AbstractCegarLoop]: Abstraction has 10664 states and 14183 transitions. [2022-11-02 20:52:29,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.818181818181818) internal successors, (194), 15 states have internal predecessors, (194), 5 states have call successors, (37), 10 states have call predecessors, (37), 7 states have return successors, (36), 7 states have call predecessors, (36), 5 states have call successors, (36) [2022-11-02 20:52:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 10664 states and 14183 transitions. [2022-11-02 20:52:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-11-02 20:52:29,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:29,642 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:29,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:29,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:29,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1411015937, now seen corresponding path program 1 times [2022-11-02 20:52:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872340209] [2022-11-02 20:52:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:52:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:52:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 20:52:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 20:52:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:52:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 20:52:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:52:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-02 20:52:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-02 20:52:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:52:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:52:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:52:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:52:30,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:30,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872340209] [2022-11-02 20:52:30,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872340209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:30,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154860704] [2022-11-02 20:52:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:30,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:30,871 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:30,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:52:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:31,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-02 20:52:31,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:31,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:31,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:52:31,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:31,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:52:31,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:52:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-02 20:52:31,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:32,060 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1112) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-11-02 20:52:32,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.base|)) (forall ((v_ArrVal_1112 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1))))) is different from false [2022-11-02 20:52:32,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int) (v_ArrVal_1112 (Array Int Int))) (or (< |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.base| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14|) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1)))) is different from false [2022-11-02 20:52:32,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| Int) (v_ArrVal_1112 (Array Int Int))) (or (< 0 |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14|) (< 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_ipheth_probe_~netdev~0#1.base_14| v_ArrVal_1112) 26) 1)))) is different from false [2022-11-02 20:52:32,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154860704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:32,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:32,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-11-02 20:52:32,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068768358] [2022-11-02 20:52:32,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:32,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:52:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:32,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:52:32,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=537, Unknown=4, NotChecked=196, Total=812 [2022-11-02 20:52:32,176 INFO L87 Difference]: Start difference. First operand 10664 states and 14183 transitions. Second operand has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-11-02 20:52:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:40,736 INFO L93 Difference]: Finished difference Result 21451 states and 29179 transitions. [2022-11-02 20:52:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:52:40,737 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) Word has length 180 [2022-11-02 20:52:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:40,790 INFO L225 Difference]: With dead ends: 21451 [2022-11-02 20:52:40,790 INFO L226 Difference]: Without dead ends: 14327 [2022-11-02 20:52:40,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=1105, Unknown=4, NotChecked=284, Total=1560 [2022-11-02 20:52:40,812 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1677 mSDsluCounter, 11735 mSDsCounter, 0 mSdLazyCounter, 7759 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 12917 SdHoareTripleChecker+Invalid, 8640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 7759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:40,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 12917 Invalid, 8640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 7759 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-11-02 20:52:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14327 states. [2022-11-02 20:52:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14327 to 10672. [2022-11-02 20:52:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10672 states, 7970 states have (on average 1.2774153074027603) internal successors, (10181), 8151 states have internal predecessors, (10181), 1808 states have call successors, (1808), 811 states have call predecessors, (1808), 893 states have return successors, (2200), 1749 states have call predecessors, (2200), 1807 states have call successors, (2200) [2022-11-02 20:52:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 14189 transitions. [2022-11-02 20:52:42,171 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 14189 transitions. Word has length 180 [2022-11-02 20:52:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:42,171 INFO L495 AbstractCegarLoop]: Abstraction has 10672 states and 14189 transitions. [2022-11-02 20:52:42,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 14 states have internal predecessors, (197), 3 states have call successors, (37), 9 states have call predecessors, (37), 6 states have return successors, (36), 5 states have call predecessors, (36), 3 states have call successors, (36) [2022-11-02 20:52:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 14189 transitions. [2022-11-02 20:52:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-11-02 20:52:42,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:42,212 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:42,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:42,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:52:42,427 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1457104041, now seen corresponding path program 2 times [2022-11-02 20:52:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:42,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293516211] [2022-11-02 20:52:42,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:42,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:52:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:52:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:52:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:52:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:52:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:52:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-02 20:52:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 20:52:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 20:52:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-02 20:52:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:52:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:52:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-11-02 20:52:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:52:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 20:52:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 20:52:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:52:43,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293516211] [2022-11-02 20:52:43,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293516211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:43,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702285752] [2022-11-02 20:52:43,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:52:43,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:43,331 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:43,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:52:44,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:52:44,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:52:44,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 2182 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:52:44,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:44,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-11-02 20:52:44,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:52:44,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:52:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-02 20:52:44,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:45,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1316) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_1318) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-11-02 20:52:46,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_1316) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_1318) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-11-02 20:52:48,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_1316) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_1318) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_1320)) 26) 1))) is different from false [2022-11-02 20:52:49,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_1320 Int) (v_ArrVal_1316 Int) (v_ArrVal_1318 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_1316) 930 v_ArrVal_1318) 0 v_ArrVal_1320)) 26) 1))) is different from false [2022-11-02 20:52:49,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702285752] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:49,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:52:49,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-11-02 20:52:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973222328] [2022-11-02 20:52:49,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-02 20:52:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-02 20:52:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=685, Unknown=4, NotChecked=220, Total=992 [2022-11-02 20:52:49,018 INFO L87 Difference]: Start difference. First operand 10672 states and 14189 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) [2022-11-02 20:52:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:58,504 INFO L93 Difference]: Finished difference Result 21705 states and 29574 transitions. [2022-11-02 20:52:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:52:58,505 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) Word has length 186 [2022-11-02 20:52:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:58,558 INFO L225 Difference]: With dead ends: 21705 [2022-11-02 20:52:58,558 INFO L226 Difference]: Without dead ends: 14577 [2022-11-02 20:52:58,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=214, Invalid=1604, Unknown=4, NotChecked=340, Total=2162 [2022-11-02 20:52:58,576 INFO L413 NwaCegarLoop]: 1225 mSDtfsCounter, 1578 mSDsluCounter, 13571 mSDsCounter, 0 mSdLazyCounter, 8952 mSolverCounterSat, 665 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 14796 SdHoareTripleChecker+Invalid, 9617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 665 IncrementalHoareTripleChecker+Valid, 8952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:58,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 14796 Invalid, 9617 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [665 Valid, 8952 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-02 20:52:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14577 states. [2022-11-02 20:52:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14577 to 11553. [2022-11-02 20:52:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11553 states, 8645 states have (on average 1.2766917293233082) internal successors, (11037), 8832 states have internal predecessors, (11037), 1938 states have call successors, (1938), 886 states have call predecessors, (1938), 969 states have return successors, (2344), 1874 states have call predecessors, (2344), 1937 states have call successors, (2344) [2022-11-02 20:52:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 15319 transitions. [2022-11-02 20:52:59,938 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 15319 transitions. Word has length 186 [2022-11-02 20:52:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:59,938 INFO L495 AbstractCegarLoop]: Abstraction has 11553 states and 15319 transitions. [2022-11-02 20:52:59,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 15 states have internal predecessors, (203), 4 states have call successors, (38), 9 states have call predecessors, (38), 6 states have return successors, (37), 6 states have call predecessors, (37), 4 states have call successors, (37) [2022-11-02 20:52:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 15319 transitions. [2022-11-02 20:52:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-02 20:52:59,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:59,967 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:00,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:00,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:53:00,191 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1275845430, now seen corresponding path program 3 times [2022-11-02 20:53:00,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:00,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174182747] [2022-11-02 20:53:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:53:00,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:53:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:53:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:53:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:53:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:53:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:53:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:53:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:53:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:53:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:53:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-02 20:53:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:00,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174182747] [2022-11-02 20:53:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174182747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:00,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:53:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420935072] [2022-11-02 20:53:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:00,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:00,644 INFO L87 Difference]: Start difference. First operand 11553 states and 15319 transitions. Second operand has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:53:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:03,935 INFO L93 Difference]: Finished difference Result 22019 states and 30032 transitions. [2022-11-02 20:53:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 194 [2022-11-02 20:53:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:03,993 INFO L225 Difference]: With dead ends: 22019 [2022-11-02 20:53:03,994 INFO L226 Difference]: Without dead ends: 14867 [2022-11-02 20:53:04,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:04,015 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 901 mSDsluCounter, 1811 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 2660 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:04,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 2660 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 20:53:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14867 states. [2022-11-02 20:53:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14867 to 11537. [2022-11-02 20:53:05,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11537 states, 8637 states have (on average 1.2760217668171818) internal successors, (11021), 8824 states have internal predecessors, (11021), 1930 states have call successors, (1930), 886 states have call predecessors, (1930), 969 states have return successors, (2332), 1866 states have call predecessors, (2332), 1929 states have call successors, (2332) [2022-11-02 20:53:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11537 states to 11537 states and 15283 transitions. [2022-11-02 20:53:05,558 INFO L78 Accepts]: Start accepts. Automaton has 11537 states and 15283 transitions. Word has length 194 [2022-11-02 20:53:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:05,558 INFO L495 AbstractCegarLoop]: Abstraction has 11537 states and 15283 transitions. [2022-11-02 20:53:05,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.125) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (19), 7 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 20:53:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11537 states and 15283 transitions. [2022-11-02 20:53:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-02 20:53:05,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:05,582 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:05,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:53:05,583 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash -276664566, now seen corresponding path program 1 times [2022-11-02 20:53:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:05,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476983117] [2022-11-02 20:53:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:53:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:53:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:53:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:53:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:53:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:53:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:53:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:53:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:53:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-02 20:53:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-02 20:53:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:53:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-02 20:53:06,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:06,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476983117] [2022-11-02 20:53:06,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476983117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:06,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:06,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:53:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606769208] [2022-11-02 20:53:06,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:06,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:53:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:06,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:53:06,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:06,394 INFO L87 Difference]: Start difference. First operand 11537 states and 15283 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:53:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:09,225 INFO L93 Difference]: Finished difference Result 19701 states and 26376 transitions. [2022-11-02 20:53:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:09,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 194 [2022-11-02 20:53:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:09,275 INFO L225 Difference]: With dead ends: 19701 [2022-11-02 20:53:09,276 INFO L226 Difference]: Without dead ends: 12565 [2022-11-02 20:53:09,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:53:09,297 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 858 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:09,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2367 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:53:09,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12565 states. [2022-11-02 20:53:10,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12565 to 11557. [2022-11-02 20:53:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11557 states, 8653 states have (on average 1.2755113833352594) internal successors, (11037), 8836 states have internal predecessors, (11037), 1934 states have call successors, (1934), 886 states have call predecessors, (1934), 969 states have return successors, (2336), 1874 states have call predecessors, (2336), 1933 states have call successors, (2336) [2022-11-02 20:53:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11557 states to 11557 states and 15307 transitions. [2022-11-02 20:53:10,485 INFO L78 Accepts]: Start accepts. Automaton has 11557 states and 15307 transitions. Word has length 194 [2022-11-02 20:53:10,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:10,485 INFO L495 AbstractCegarLoop]: Abstraction has 11557 states and 15307 transitions. [2022-11-02 20:53:10,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 4 states have internal predecessors, (123), 3 states have call successors, (19), 7 states have call predecessors, (19), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-02 20:53:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11557 states and 15307 transitions. [2022-11-02 20:53:10,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-02 20:53:10,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:10,512 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:10,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:53:10,513 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 454006962, now seen corresponding path program 2 times [2022-11-02 20:53:10,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:10,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868998227] [2022-11-02 20:53:10,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:10,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:53:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:53:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:53:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-02 20:53:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:53:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-02 20:53:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:53:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-02 20:53:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:53:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-02 20:53:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-02 20:53:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-02 20:53:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-11-02 20:53:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868998227] [2022-11-02 20:53:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868998227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731943561] [2022-11-02 20:53:11,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:53:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:11,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:11,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:53:12,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:53:12,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:53:12,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 2251 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:53:12,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:12,989 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-02 20:53:12,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 45 [2022-11-02 20:53:13,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:53:13,214 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-02 20:53:13,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-02 20:53:13,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:13,383 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:53:13,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:53:13,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:53:13,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:53:13,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:53:13,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:53:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 55 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-02 20:53:13,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:13,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1786) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-11-02 20:53:13,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1786 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_1786) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-11-02 20:53:14,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731943561] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:14,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:14,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2022-11-02 20:53:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107326078] [2022-11-02 20:53:14,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-02 20:53:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-02 20:53:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1087, Unknown=8, NotChecked=134, Total=1332 [2022-11-02 20:53:14,100 INFO L87 Difference]: Start difference. First operand 11557 states and 15307 transitions. Second operand has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-02 20:53:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:25,490 INFO L93 Difference]: Finished difference Result 22741 states and 30552 transitions. [2022-11-02 20:53:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-02 20:53:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) Word has length 200 [2022-11-02 20:53:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:25,525 INFO L225 Difference]: With dead ends: 22741 [2022-11-02 20:53:25,525 INFO L226 Difference]: Without dead ends: 15561 [2022-11-02 20:53:25,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=404, Invalid=3501, Unknown=9, NotChecked=246, Total=4160 [2022-11-02 20:53:25,545 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 2382 mSDsluCounter, 13950 mSDsCounter, 0 mSdLazyCounter, 10042 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 14945 SdHoareTripleChecker+Invalid, 12079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 10042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:25,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 14945 Invalid, 12079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1187 Valid, 10042 Invalid, 0 Unknown, 850 Unchecked, 8.6s Time] [2022-11-02 20:53:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15561 states. [2022-11-02 20:53:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15561 to 13109. [2022-11-02 20:53:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 9840 states have (on average 1.2760162601626017) internal successors, (12556), 10027 states have internal predecessors, (12556), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1100 states have return successors, (2588), 2092 states have call predecessors, (2588), 2167 states have call successors, (2588) [2022-11-02 20:53:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 17312 transitions. [2022-11-02 20:53:27,451 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 17312 transitions. Word has length 200 [2022-11-02 20:53:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 13109 states and 17312 transitions. [2022-11-02 20:53:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.75) internal successors, (217), 21 states have internal predecessors, (217), 6 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 8 states have call predecessors, (38), 6 states have call successors, (38) [2022-11-02 20:53:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 17312 transitions. [2022-11-02 20:53:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-02 20:53:27,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:27,488 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:27,531 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:27,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:53:27,715 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:27,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:27,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1863810439, now seen corresponding path program 1 times [2022-11-02 20:53:27,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:27,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506640872] [2022-11-02 20:53:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:27,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:53:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:53:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:53:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:53:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:53:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:53:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:53:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 20:53:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:53:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 20:53:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-02 20:53:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-02 20:53:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-02 20:53:28,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:28,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506640872] [2022-11-02 20:53:28,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506640872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:28,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:28,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:53:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280619476] [2022-11-02 20:53:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:28,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:53:28,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:28,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:53:28,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:28,625 INFO L87 Difference]: Start difference. First operand 13109 states and 17312 transitions. Second operand has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-02 20:53:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:32,504 INFO L93 Difference]: Finished difference Result 23691 states and 32221 transitions. [2022-11-02 20:53:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:53:32,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 211 [2022-11-02 20:53:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:32,548 INFO L225 Difference]: With dead ends: 23691 [2022-11-02 20:53:32,548 INFO L226 Difference]: Without dead ends: 16503 [2022-11-02 20:53:32,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:53:32,569 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 917 mSDsluCounter, 3507 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 4353 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:32,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 4353 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:53:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16503 states. [2022-11-02 20:53:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16503 to 13137. [2022-11-02 20:53:33,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13137 states, 9860 states have (on average 1.2766734279918863) internal successors, (12588), 10055 states have internal predecessors, (12588), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-11-02 20:53:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 17376 transitions. [2022-11-02 20:53:33,983 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 17376 transitions. Word has length 211 [2022-11-02 20:53:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:33,984 INFO L495 AbstractCegarLoop]: Abstraction has 13137 states and 17376 transitions. [2022-11-02 20:53:33,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.3) internal successors, (123), 5 states have internal predecessors, (123), 3 states have call successors, (20), 7 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-02 20:53:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 17376 transitions. [2022-11-02 20:53:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-02 20:53:34,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:34,011 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:34,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:53:34,011 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:34,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1503128751, now seen corresponding path program 1 times [2022-11-02 20:53:34,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:34,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583399841] [2022-11-02 20:53:34,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:53:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:53:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:53:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:53:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:53:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:53:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:53:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 20:53:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:53:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:53:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:53:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-02 20:53:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-02 20:53:34,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:34,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583399841] [2022-11-02 20:53:34,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583399841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:34,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167286865] [2022-11-02 20:53:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:34,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:34,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:34,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:53:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:35,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 2423 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:53:35,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-02 20:53:35,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-11-02 20:53:35,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167286865] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:35,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:35,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11, 5] total 12 [2022-11-02 20:53:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444760124] [2022-11-02 20:53:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:35,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:35,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:53:35,898 INFO L87 Difference]: Start difference. First operand 13137 states and 17376 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:53:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:37,544 INFO L93 Difference]: Finished difference Result 20397 states and 27455 transitions. [2022-11-02 20:53:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:37,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 212 [2022-11-02 20:53:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:37,574 INFO L225 Difference]: With dead ends: 20397 [2022-11-02 20:53:37,574 INFO L226 Difference]: Without dead ends: 13181 [2022-11-02 20:53:37,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 461 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:53:37,592 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 3 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:37,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1962 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13181 states. [2022-11-02 20:53:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13181 to 13157. [2022-11-02 20:53:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13157 states, 9880 states have (on average 1.2765182186234818) internal successors, (12612), 10075 states have internal predecessors, (12612), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-11-02 20:53:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13157 states to 13157 states and 17400 transitions. [2022-11-02 20:53:38,931 INFO L78 Accepts]: Start accepts. Automaton has 13157 states and 17400 transitions. Word has length 212 [2022-11-02 20:53:38,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:38,932 INFO L495 AbstractCegarLoop]: Abstraction has 13157 states and 17400 transitions. [2022-11-02 20:53:38,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 20:53:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13157 states and 17400 transitions. [2022-11-02 20:53:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-02 20:53:38,963 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:38,963 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:39,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:39,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:39,187 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -361861751, now seen corresponding path program 1 times [2022-11-02 20:53:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:39,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159039213] [2022-11-02 20:53:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:53:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:53:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:53:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:53:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:53:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:53:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:53:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:53:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:53:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:53:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 20:53:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:53:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:53:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:53:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-02 20:53:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-02 20:53:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 20:53:40,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:40,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159039213] [2022-11-02 20:53:40,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159039213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:40,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514673852] [2022-11-02 20:53:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:40,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:40,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:40,103 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:40,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:53:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 2442 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:53:40,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:41,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:53:41,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:41,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:53:41,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-11-02 20:53:41,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:53:41,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:53:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 91 proven. 19 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:53:41,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:42,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_2721) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_2720) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-11-02 20:53:44,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_2721) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_2720) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-11-02 20:53:45,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_2721) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_2720) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_2722)) 26) 1))) is different from false [2022-11-02 20:53:45,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_2720 Int) (v_ArrVal_2722 Int) (v_ArrVal_2721 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_2721) 930 v_ArrVal_2720) 0 v_ArrVal_2722)) 26) 1))) is different from false [2022-11-02 20:53:45,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514673852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:45,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:45,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 26 [2022-11-02 20:53:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110243413] [2022-11-02 20:53:45,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:45,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:53:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:53:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=790, Unknown=4, NotChecked=236, Total=1122 [2022-11-02 20:53:45,888 INFO L87 Difference]: Start difference. First operand 13157 states and 17400 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-11-02 20:53:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:57,582 INFO L93 Difference]: Finished difference Result 27093 states and 36763 transitions. [2022-11-02 20:53:57,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-02 20:53:57,583 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 213 [2022-11-02 20:53:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:57,624 INFO L225 Difference]: With dead ends: 27093 [2022-11-02 20:53:57,624 INFO L226 Difference]: Without dead ends: 19847 [2022-11-02 20:53:57,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=488, Invalid=3814, Unknown=4, NotChecked=524, Total=4830 [2022-11-02 20:53:57,639 INFO L413 NwaCegarLoop]: 1249 mSDtfsCounter, 2123 mSDsluCounter, 12716 mSDsCounter, 0 mSdLazyCounter, 8861 mSolverCounterSat, 1144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2218 SdHoareTripleChecker+Valid, 13965 SdHoareTripleChecker+Invalid, 10717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1144 IncrementalHoareTripleChecker+Valid, 8861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 712 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:57,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2218 Valid, 13965 Invalid, 10717 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1144 Valid, 8861 Invalid, 0 Unknown, 712 Unchecked, 7.9s Time] [2022-11-02 20:53:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19847 states. [2022-11-02 20:53:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19847 to 13173. [2022-11-02 20:53:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13173 states, 9896 states have (on average 1.276879547291835) internal successors, (12636), 10091 states have internal predecessors, (12636), 2168 states have call successors, (2168), 1029 states have call predecessors, (2168), 1108 states have return successors, (2620), 2092 states have call predecessors, (2620), 2167 states have call successors, (2620) [2022-11-02 20:53:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13173 states to 13173 states and 17424 transitions. [2022-11-02 20:53:59,064 INFO L78 Accepts]: Start accepts. Automaton has 13173 states and 17424 transitions. Word has length 213 [2022-11-02 20:53:59,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:59,065 INFO L495 AbstractCegarLoop]: Abstraction has 13173 states and 17424 transitions. [2022-11-02 20:53:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-11-02 20:53:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 13173 states and 17424 transitions. [2022-11-02 20:53:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-02 20:53:59,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:59,084 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:59,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:59,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:59,285 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash -158585203, now seen corresponding path program 2 times [2022-11-02 20:53:59,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:59,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435120063] [2022-11-02 20:53:59,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-02 20:54:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-02 20:54:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-02 20:54:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 20:54:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-02 20:54:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-02 20:54:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-02 20:54:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-02 20:54:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-02 20:54:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-02 20:54:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-02 20:54:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-02 20:54:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 20:54:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-02 20:54:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 20:54:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435120063] [2022-11-02 20:54:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435120063] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613652787] [2022-11-02 20:54:00,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:54:00,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:00,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:00,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:54:01,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:54:01,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:54:01,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 2563 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-02 20:54:01,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:01,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:54:01,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:01,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:01,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-11-02 20:54:01,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:54:01,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-02 20:54:01,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:03,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ 420 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_3299) (+ 930 |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset|) v_ArrVal_3301) |c_ULTIMATE.start_ipheth_probe_~netdev~0#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-11-02 20:54:04,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 420) v_ArrVal_3299) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| 930) v_ArrVal_3301) |c_ULTIMATE.start_alloc_etherdev_mqs_#res#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-11-02 20:54:06,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 420) v_ArrVal_3299) (+ |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| 930) v_ArrVal_3301) |c_ULTIMATE.start_alloc_etherdev_mqs_#t~ret347#1.offset| v_ArrVal_3304)) 26) 1))) is different from false [2022-11-02 20:54:06,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ipheth_probe_~netdev~0#1.base| Int) (v_ArrVal_3304 Int) (v_ArrVal_3301 Int) (v_ArrVal_3299 Int)) (< 0 (select (select (store |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base| (store (store (store (select |c_#memory_int| |ULTIMATE.start_ipheth_probe_~netdev~0#1.base|) 420 v_ArrVal_3299) 930 v_ArrVal_3301) 0 v_ArrVal_3304)) 26) 1))) is different from false [2022-11-02 20:54:06,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613652787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:06,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:06,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2022-11-02 20:54:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953311133] [2022-11-02 20:54:06,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:06,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:54:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:54:06,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=907, Unknown=4, NotChecked=252, Total=1260 [2022-11-02 20:54:06,959 INFO L87 Difference]: Start difference. First operand 13173 states and 17424 transitions. Second operand has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-11-02 20:54:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:22,285 INFO L93 Difference]: Finished difference Result 30123 states and 40915 transitions. [2022-11-02 20:54:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-02 20:54:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 214 [2022-11-02 20:54:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:22,341 INFO L225 Difference]: With dead ends: 30123 [2022-11-02 20:54:22,341 INFO L226 Difference]: Without dead ends: 22861 [2022-11-02 20:54:22,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=530, Invalid=4174, Unknown=4, NotChecked=548, Total=5256 [2022-11-02 20:54:22,362 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 2058 mSDsluCounter, 17598 mSDsCounter, 0 mSdLazyCounter, 12152 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2155 SdHoareTripleChecker+Valid, 19052 SdHoareTripleChecker+Invalid, 14320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 12152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:22,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2155 Valid, 19052 Invalid, 14320 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1077 Valid, 12152 Invalid, 0 Unknown, 1091 Unchecked, 11.2s Time] [2022-11-02 20:54:22,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22861 states. [2022-11-02 20:54:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22861 to 13187. [2022-11-02 20:54:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13187 states, 9908 states have (on average 1.2774525635849818) internal successors, (12657), 10103 states have internal predecessors, (12657), 2169 states have call successors, (2169), 1030 states have call predecessors, (2169), 1109 states have return successors, (2622), 2093 states have call predecessors, (2622), 2168 states have call successors, (2622) [2022-11-02 20:54:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13187 states to 13187 states and 17448 transitions. [2022-11-02 20:54:24,131 INFO L78 Accepts]: Start accepts. Automaton has 13187 states and 17448 transitions. Word has length 214 [2022-11-02 20:54:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:24,132 INFO L495 AbstractCegarLoop]: Abstraction has 13187 states and 17448 transitions. [2022-11-02 20:54:24,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.923076923076923) internal successors, (232), 20 states have internal predecessors, (232), 7 states have call successors, (41), 10 states have call predecessors, (41), 8 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2022-11-02 20:54:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 13187 states and 17448 transitions. [2022-11-02 20:54:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-02 20:54:24,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:24,149 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:24,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:24,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:54:24,363 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:24,363 INFO L85 PathProgramCache]: Analyzing trace with hash -266252569, now seen corresponding path program 1 times [2022-11-02 20:54:24,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:24,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984486311] [2022-11-02 20:54:24,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:24,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:54:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:54:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:54:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-02 20:54:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-02 20:54:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-02 20:54:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-02 20:54:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:54:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 20:54:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 20:54:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-02 20:54:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-02 20:54:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-11-02 20:54:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:25,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984486311] [2022-11-02 20:54:25,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984486311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:25,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556438299] [2022-11-02 20:54:25,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:25,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:25,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:25,764 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:25,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:54:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:26,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 2676 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-02 20:54:26,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:27,024 INFO L356 Elim1Store]: treesize reduction 79, result has 32.5 percent of original size [2022-11-02 20:54:27,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 49 [2022-11-02 20:54:27,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:54:27,234 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-02 20:54:27,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-02 20:54:27,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:27,431 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:27,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:54:27,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:27,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:27,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:27,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:28,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 67 proven. 16 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-02 20:54:28,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:28,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)) 0))) is different from false [2022-11-02 20:54:28,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)) 0))) is different from false [2022-11-02 20:54:28,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4064 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4064) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)) 0))) is different from false [2022-11-02 20:54:28,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556438299] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:28,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:28,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 30 [2022-11-02 20:54:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905318417] [2022-11-02 20:54:28,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:28,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:54:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:54:28,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1229, Unknown=5, NotChecked=216, Total=1560 [2022-11-02 20:54:28,496 INFO L87 Difference]: Start difference. First operand 13187 states and 17448 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-11-02 20:54:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:42,563 INFO L93 Difference]: Finished difference Result 25121 states and 34447 transitions. [2022-11-02 20:54:42,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 20:54:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) Word has length 212 [2022-11-02 20:54:42,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:42,607 INFO L225 Difference]: With dead ends: 25121 [2022-11-02 20:54:42,607 INFO L226 Difference]: Without dead ends: 17861 [2022-11-02 20:54:42,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=325, Invalid=3222, Unknown=5, NotChecked=354, Total=3906 [2022-11-02 20:54:42,621 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1474 mSDsluCounter, 15962 mSDsCounter, 0 mSdLazyCounter, 10110 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 17131 SdHoareTripleChecker+Invalid, 11446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 10110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 689 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:42,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 17131 Invalid, 11446 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [647 Valid, 10110 Invalid, 0 Unknown, 689 Unchecked, 10.9s Time] [2022-11-02 20:54:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17861 states. [2022-11-02 20:54:44,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17861 to 13433. [2022-11-02 20:54:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13433 states, 10140 states have (on average 1.2837278106508876) internal successors, (13017), 10334 states have internal predecessors, (13017), 2176 states have call successors, (2176), 1037 states have call predecessors, (2176), 1116 states have return successors, (2632), 2101 states have call predecessors, (2632), 2175 states have call successors, (2632) [2022-11-02 20:54:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13433 states to 13433 states and 17825 transitions. [2022-11-02 20:54:44,120 INFO L78 Accepts]: Start accepts. Automaton has 13433 states and 17825 transitions. Word has length 212 [2022-11-02 20:54:44,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:44,120 INFO L495 AbstractCegarLoop]: Abstraction has 13433 states and 17825 transitions. [2022-11-02 20:54:44,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 24 states have internal predecessors, (227), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38) [2022-11-02 20:54:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13433 states and 17825 transitions. [2022-11-02 20:54:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-02 20:54:44,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:44,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:44,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:44,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:44,337 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:54:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:44,338 INFO L85 PathProgramCache]: Analyzing trace with hash 582910906, now seen corresponding path program 2 times [2022-11-02 20:54:44,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:44,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508238675] [2022-11-02 20:54:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:44,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 20:54:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 20:54:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 20:54:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-02 20:54:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 20:54:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:54:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 20:54:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:54:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-02 20:54:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 20:54:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:54:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-02 20:54:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:54:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-02 20:54:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-02 20:54:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-11-02 20:54:45,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:45,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508238675] [2022-11-02 20:54:45,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508238675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:45,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855765712] [2022-11-02 20:54:45,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:54:45,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:45,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:45,895 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:45,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_081e100c-307f-48f9-b718-8520c36c5f64/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:54:46,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:54:46,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:54:46,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 2814 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-02 20:54:46,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:47,171 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-02 20:54:47,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 45 [2022-11-02 20:54:47,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-02 20:54:47,403 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-02 20:54:47,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-02 20:54:47,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:47,572 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:47,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:54:47,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:47,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:47,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:47,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:47,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:47,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:47,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:47,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:48,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:54:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 67 proven. 24 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-02 20:54:48,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:48,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1| 1)))) is different from false [2022-11-02 20:54:48,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 2 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-11-02 20:54:48,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 3 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-11-02 20:54:48,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4999 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_4999) |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.base|) (+ 4 |c_ULTIMATE.start_#Ultimate.C_strcpy_src#1.offset| |c_ULTIMATE.start_#Ultimate.C_strcpy_#t~offset383#1|)))) is different from false [2022-11-02 20:54:48,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855765712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:48,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:48,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2022-11-02 20:54:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546558949] [2022-11-02 20:54:48,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:48,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:54:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:48,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:54:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1358, Unknown=11, NotChecked=308, Total=1806 [2022-11-02 20:54:48,650 INFO L87 Difference]: Start difference. First operand 13433 states and 17825 transitions. Second operand has 32 states, 32 states have (on average 7.1875) internal successors, (230), 26 states have internal predecessors, (230), 7 states have call successors, (39), 10 states have call predecessors, (39), 7 states have return successors, (38), 7 states have call predecessors, (38), 7 states have call successors, (38)