./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:36:13,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:36:13,471 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 00:36:13,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:36:13,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:36:13,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:36:13,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:36:13,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:36:13,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:36:13,504 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:36:13,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:36:13,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:36:13,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:36:13,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:36:13,507 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:36:13,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:36:13,508 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:36:13,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:36:13,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:36:13,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:36:13,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:36:13,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:36:13,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:36:13,512 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:36:13,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:36:13,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:36:13,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:36:13,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:36:13,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:36:13,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:36:13,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:36:13,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:36:13,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:36:13,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:36:13,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:36:13,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:36:13,517 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:36:13,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:36:13,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:36:13,518 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/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_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2023-11-29 00:36:13,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:36:13,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:36:13,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:36:13,768 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:36:13,768 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:36:13,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-29 00:36:16,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:36:16,850 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:36:16,851 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-29 00:36:16,878 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data/bc4d0a28e/124f27736c4f4a8a8f5ccedb2f47b705/FLAG5a18e58cf [2023-11-29 00:36:16,892 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data/bc4d0a28e/124f27736c4f4a8a8f5ccedb2f47b705 [2023-11-29 00:36:16,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:36:16,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:36:16,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:36:16,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:36:16,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:36:16,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:36:16" (1/1) ... [2023-11-29 00:36:16,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6421d991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:16, skipping insertion in model container [2023-11-29 00:36:16,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:36:16" (1/1) ... [2023-11-29 00:36:16,982 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:36:17,668 WARN L240 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_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-11-29 00:36:17,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:36:17,740 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:36:17,946 WARN L240 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_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-11-29 00:36:17,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:36:17,997 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:36:17,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17 WrapperNode [2023-11-29 00:36:17,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:36:17,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:36:17,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:36:17,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:36:18,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,044 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,104 INFO L138 Inliner]: procedures = 109, calls = 320, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 866 [2023-11-29 00:36:18,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:36:18,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:36:18,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:36:18,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:36:18,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,227 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 7, 110, 39]. 70 percent of accesses are in the largest equivalence class. The 94 initializations are split as follows [2, 7, 46, 39]. The 21 writes are split as follows [0, 0, 21, 0]. [2023-11-29 00:36:18,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,264 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:36:18,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:36:18,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:36:18,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:36:18,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (1/1) ... [2023-11-29 00:36:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:36:18,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:18,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:36:18,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:36:18,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 00:36:18,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 00:36:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 00:36:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 00:36:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 00:36:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 00:36:18,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-29 00:36:18,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-29 00:36:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 00:36:18,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 00:36:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 00:36:18,379 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 00:36:18,379 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2023-11-29 00:36:18,380 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2023-11-29 00:36:18,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:36:18,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:36:18,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:36:18,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:36:18,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 00:36:18,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 00:36:18,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 00:36:18,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 00:36:18,381 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2023-11-29 00:36:18,382 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2023-11-29 00:36:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-11-29 00:36:18,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-11-29 00:36:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:36:18,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:36:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:36:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:36:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-29 00:36:18,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-29 00:36:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:36:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:36:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:36:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:36:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2023-11-29 00:36:18,384 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2023-11-29 00:36:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2023-11-29 00:36:18,384 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2023-11-29 00:36:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2023-11-29 00:36:18,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2023-11-29 00:36:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:36:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:36:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:36:18,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:36:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:36:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 00:36:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 00:36:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 00:36:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 00:36:18,386 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 00:36:18,386 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 00:36:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-29 00:36:18,387 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-29 00:36:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-29 00:36:18,387 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-29 00:36:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:36:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:36:18,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:36:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:36:18,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:36:18,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:36:18,700 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:36:18,703 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:36:18,796 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 00:36:19,430 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:36:19,553 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:36:19,553 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:36:19,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:19 BoogieIcfgContainer [2023-11-29 00:36:19,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:36:19,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:36:19,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:36:19,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:36:19,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:36:16" (1/3) ... [2023-11-29 00:36:19,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e86935d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:36:19, skipping insertion in model container [2023-11-29 00:36:19,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:36:17" (2/3) ... [2023-11-29 00:36:19,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e86935d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:36:19, skipping insertion in model container [2023-11-29 00:36:19,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:36:19" (3/3) ... [2023-11-29 00:36:19,563 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-29 00:36:19,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:36:19,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:36:19,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:36:19,653 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=LoopHeads, 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;@598e557c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:36:19,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:36:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 155 states have internal predecessors, (215), 44 states have call successors, (44), 17 states have call predecessors, (44), 16 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 00:36:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:36:19,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:19,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:19,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:19,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:19,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1743562403, now seen corresponding path program 1 times [2023-11-29 00:36:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:19,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290527139] [2023-11-29 00:36:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:19,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:20,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290527139] [2023-11-29 00:36:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290527139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:36:20,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80064767] [2023-11-29 00:36:20,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:20,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:20,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:20,093 INFO L87 Difference]: Start difference. First operand has 208 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 155 states have internal predecessors, (215), 44 states have call successors, (44), 17 states have call predecessors, (44), 16 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:36:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:21,869 INFO L93 Difference]: Finished difference Result 417 states and 615 transitions. [2023-11-29 00:36:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:21,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 00:36:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:21,883 INFO L225 Difference]: With dead ends: 417 [2023-11-29 00:36:21,883 INFO L226 Difference]: Without dead ends: 204 [2023-11-29 00:36:21,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:36:21,892 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 37 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:21,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 504 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 00:36:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-11-29 00:36:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2023-11-29 00:36:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 144 states have (on average 1.4097222222222223) internal successors, (203), 147 states have internal predecessors, (203), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:36:21,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 279 transitions. [2023-11-29 00:36:21,956 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 279 transitions. Word has length 25 [2023-11-29 00:36:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:21,957 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 279 transitions. [2023-11-29 00:36:21,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:36:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 279 transitions. [2023-11-29 00:36:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:36:21,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:21,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:21,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:36:21,960 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:21,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1530336539, now seen corresponding path program 1 times [2023-11-29 00:36:21,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:21,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026916774] [2023-11-29 00:36:21,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:21,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:36:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026916774] [2023-11-29 00:36:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026916774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:22,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:22,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113087652] [2023-11-29 00:36:22,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:22,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:22,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:22,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:22,123 INFO L87 Difference]: Start difference. First operand 200 states and 279 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:36:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:25,021 INFO L93 Difference]: Finished difference Result 582 states and 822 transitions. [2023-11-29 00:36:25,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 4 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 25 [2023-11-29 00:36:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:25,028 INFO L225 Difference]: With dead ends: 582 [2023-11-29 00:36:25,028 INFO L226 Difference]: Without dead ends: 385 [2023-11-29 00:36:25,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:25,032 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 281 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:25,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 662 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:36:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2023-11-29 00:36:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 377. [2023-11-29 00:36:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 274 states have (on average 1.4014598540145986) internal successors, (384), 277 states have internal predecessors, (384), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 00:36:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 526 transitions. [2023-11-29 00:36:25,081 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 526 transitions. Word has length 25 [2023-11-29 00:36:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:25,082 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 526 transitions. [2023-11-29 00:36:25,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:36:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 526 transitions. [2023-11-29 00:36:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:25,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:25,085 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:25,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:36:25,086 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:25,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1257446715, now seen corresponding path program 1 times [2023-11-29 00:36:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401255792] [2023-11-29 00:36:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:36:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401255792] [2023-11-29 00:36:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401255792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138889300] [2023-11-29 00:36:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:25,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:25,246 INFO L87 Difference]: Start difference. First operand 377 states and 526 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:36:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:26,826 INFO L93 Difference]: Finished difference Result 407 states and 570 transitions. [2023-11-29 00:36:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:36:26,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 4 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 [2023-11-29 00:36:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:26,831 INFO L225 Difference]: With dead ends: 407 [2023-11-29 00:36:26,832 INFO L226 Difference]: Without dead ends: 396 [2023-11-29 00:36:26,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:26,834 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 273 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:26,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 522 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 00:36:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-11-29 00:36:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 377. [2023-11-29 00:36:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 274 states have (on average 1.397810218978102) internal successors, (383), 277 states have internal predecessors, (383), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 00:36:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 525 transitions. [2023-11-29 00:36:26,870 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 525 transitions. Word has length 44 [2023-11-29 00:36:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:26,871 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 525 transitions. [2023-11-29 00:36:26,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 00:36:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 525 transitions. [2023-11-29 00:36:26,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:36:26,874 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:26,874 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:26,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:36:26,875 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:26,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1200188413, now seen corresponding path program 1 times [2023-11-29 00:36:26,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748832935] [2023-11-29 00:36:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:26,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:36:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:27,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748832935] [2023-11-29 00:36:27,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748832935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:27,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954826180] [2023-11-29 00:36:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:27,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:27,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:27,030 INFO L87 Difference]: Start difference. First operand 377 states and 525 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:29,180 INFO L93 Difference]: Finished difference Result 1118 states and 1580 transitions. [2023-11-29 00:36:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:36:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2023-11-29 00:36:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:29,188 INFO L225 Difference]: With dead ends: 1118 [2023-11-29 00:36:29,188 INFO L226 Difference]: Without dead ends: 752 [2023-11-29 00:36:29,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:29,191 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 343 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:29,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 610 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 00:36:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2023-11-29 00:36:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 734. [2023-11-29 00:36:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 538 states have (on average 1.3921933085501859) internal successors, (749), 541 states have internal predecessors, (749), 139 states have call successors, (139), 57 states have call predecessors, (139), 56 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-11-29 00:36:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1023 transitions. [2023-11-29 00:36:29,258 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1023 transitions. Word has length 44 [2023-11-29 00:36:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:29,259 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1023 transitions. [2023-11-29 00:36:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1023 transitions. [2023-11-29 00:36:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 00:36:29,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:29,262 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:29,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:36:29,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:29,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1448875413, now seen corresponding path program 1 times [2023-11-29 00:36:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345589902] [2023-11-29 00:36:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:29,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:36:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345589902] [2023-11-29 00:36:29,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345589902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:29,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958564460] [2023-11-29 00:36:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:29,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:29,417 INFO L87 Difference]: Start difference. First operand 734 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:30,640 INFO L93 Difference]: Finished difference Result 752 states and 1060 transitions. [2023-11-29 00:36:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-11-29 00:36:30,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:30,648 INFO L225 Difference]: With dead ends: 752 [2023-11-29 00:36:30,648 INFO L226 Difference]: Without dead ends: 749 [2023-11-29 00:36:30,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:30,649 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 287 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:30,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 342 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:36:30,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2023-11-29 00:36:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 733. [2023-11-29 00:36:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 538 states have (on average 1.3903345724907064) internal successors, (748), 540 states have internal predecessors, (748), 138 states have call successors, (138), 57 states have call predecessors, (138), 56 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-11-29 00:36:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1021 transitions. [2023-11-29 00:36:30,703 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1021 transitions. Word has length 45 [2023-11-29 00:36:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:30,703 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 1021 transitions. [2023-11-29 00:36:30,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1021 transitions. [2023-11-29 00:36:30,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 00:36:30,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:30,705 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:30,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:36:30,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:30,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1965480262, now seen corresponding path program 1 times [2023-11-29 00:36:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:30,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634127942] [2023-11-29 00:36:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:36:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634127942] [2023-11-29 00:36:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634127942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268235780] [2023-11-29 00:36:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:30,839 INFO L87 Difference]: Start difference. First operand 733 states and 1021 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:32,108 INFO L93 Difference]: Finished difference Result 751 states and 1058 transitions. [2023-11-29 00:36:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:32,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2023-11-29 00:36:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:32,114 INFO L225 Difference]: With dead ends: 751 [2023-11-29 00:36:32,114 INFO L226 Difference]: Without dead ends: 748 [2023-11-29 00:36:32,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:32,116 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 255 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:32,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 474 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:36:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-11-29 00:36:32,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 732. [2023-11-29 00:36:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 538 states have (on average 1.3884758364312269) internal successors, (747), 539 states have internal predecessors, (747), 137 states have call successors, (137), 57 states have call predecessors, (137), 56 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-11-29 00:36:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1019 transitions. [2023-11-29 00:36:32,168 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1019 transitions. Word has length 46 [2023-11-29 00:36:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:32,168 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1019 transitions. [2023-11-29 00:36:32,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1019 transitions. [2023-11-29 00:36:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 00:36:32,170 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:32,170 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:36:32,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:36:32,171 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:32,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash 800366264, now seen corresponding path program 1 times [2023-11-29 00:36:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079463520] [2023-11-29 00:36:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:32,306 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:36:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079463520] [2023-11-29 00:36:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079463520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:36:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745807381] [2023-11-29 00:36:32,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:32,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:32,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:32,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:36:32,309 INFO L87 Difference]: Start difference. First operand 732 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:34,294 INFO L93 Difference]: Finished difference Result 750 states and 1056 transitions. [2023-11-29 00:36:34,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:36:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2023-11-29 00:36:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:34,300 INFO L225 Difference]: With dead ends: 750 [2023-11-29 00:36:34,301 INFO L226 Difference]: Without dead ends: 742 [2023-11-29 00:36:34,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:34,302 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 252 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:34,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 472 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 00:36:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-11-29 00:36:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 726. [2023-11-29 00:36:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 533 states have (on average 1.3864915572232646) internal successors, (739), 533 states have internal predecessors, (739), 136 states have call successors, (136), 57 states have call predecessors, (136), 56 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-11-29 00:36:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1010 transitions. [2023-11-29 00:36:34,359 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1010 transitions. Word has length 47 [2023-11-29 00:36:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:34,359 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 1010 transitions. [2023-11-29 00:36:34,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-29 00:36:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1010 transitions. [2023-11-29 00:36:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 00:36:34,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:34,364 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:34,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:36:34,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:34,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:34,365 INFO L85 PathProgramCache]: Analyzing trace with hash -484507995, now seen corresponding path program 1 times [2023-11-29 00:36:34,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:34,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024725740] [2023-11-29 00:36:34,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:34,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 00:36:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:36:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:36:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:36:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-29 00:36:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:36:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 00:36:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:36:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-29 00:36:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-29 00:36:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024725740] [2023-11-29 00:36:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024725740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:36:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085113727] [2023-11-29 00:36:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:36:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:36:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:36:34,609 INFO L87 Difference]: Start difference. First operand 726 states and 1010 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:37,945 INFO L93 Difference]: Finished difference Result 1518 states and 2128 transitions. [2023-11-29 00:36:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:36:37,946 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2023-11-29 00:36:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:37,951 INFO L225 Difference]: With dead ends: 1518 [2023-11-29 00:36:37,951 INFO L226 Difference]: Without dead ends: 803 [2023-11-29 00:36:37,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:36:37,954 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 106 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:37,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 782 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 00:36:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2023-11-29 00:36:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 780. [2023-11-29 00:36:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 586 states have (on average 1.3873720136518772) internal successors, (813), 586 states have internal predecessors, (813), 136 states have call successors, (136), 58 states have call predecessors, (136), 57 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-11-29 00:36:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1084 transitions. [2023-11-29 00:36:37,993 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1084 transitions. Word has length 133 [2023-11-29 00:36:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:37,994 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1084 transitions. [2023-11-29 00:36:37,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1084 transitions. [2023-11-29 00:36:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:36:37,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:37,998 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:37,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:36:37,998 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:37,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:37,999 INFO L85 PathProgramCache]: Analyzing trace with hash 610975840, now seen corresponding path program 1 times [2023-11-29 00:36:37,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:37,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520185659] [2023-11-29 00:36:37,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:37,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:36:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:36:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:36:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 00:36:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:36:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 00:36:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:36:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-29 00:36:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:38,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520185659] [2023-11-29 00:36:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520185659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:38,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:36:38,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:36:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136600304] [2023-11-29 00:36:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:38,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:36:38,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:38,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:36:38,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:36:38,399 INFO L87 Difference]: Start difference. First operand 780 states and 1084 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:42,328 INFO L93 Difference]: Finished difference Result 1625 states and 2289 transitions. [2023-11-29 00:36:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:36:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2023-11-29 00:36:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:42,336 INFO L225 Difference]: With dead ends: 1625 [2023-11-29 00:36:42,336 INFO L226 Difference]: Without dead ends: 860 [2023-11-29 00:36:42,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:42,339 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:42,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1084 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 00:36:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-29 00:36:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 788. [2023-11-29 00:36:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 594 states have (on average 1.3821548821548821) internal successors, (821), 594 states have internal predecessors, (821), 136 states have call successors, (136), 58 states have call predecessors, (136), 57 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2023-11-29 00:36:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1092 transitions. [2023-11-29 00:36:42,410 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1092 transitions. Word has length 139 [2023-11-29 00:36:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:42,411 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1092 transitions. [2023-11-29 00:36:42,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1092 transitions. [2023-11-29 00:36:42,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:36:42,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:42,415 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:42,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:36:42,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:42,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash -58669920, now seen corresponding path program 1 times [2023-11-29 00:36:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353516670] [2023-11-29 00:36:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:36:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:36:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:36:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 00:36:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:36:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 00:36:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:36:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-29 00:36:42,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353516670] [2023-11-29 00:36:42,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353516670] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:42,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270507759] [2023-11-29 00:36:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:42,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:42,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:42,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:42,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:36:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:43,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:36:43,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-29 00:36:43,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270507759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:43,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:43,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-29 00:36:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508691606] [2023-11-29 00:36:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:43,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:43,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:43,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:43,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:43,408 INFO L87 Difference]: Start difference. First operand 788 states and 1092 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:47,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:36:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:48,755 INFO L93 Difference]: Finished difference Result 2398 states and 3326 transitions. [2023-11-29 00:36:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:36:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2023-11-29 00:36:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:48,766 INFO L225 Difference]: With dead ends: 2398 [2023-11-29 00:36:48,767 INFO L226 Difference]: Without dead ends: 1625 [2023-11-29 00:36:48,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:36:48,770 INFO L413 NwaCegarLoop]: 446 mSDtfsCounter, 311 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:48,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1515 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-29 00:36:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2023-11-29 00:36:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 820. [2023-11-29 00:36:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 618 states have (on average 1.367313915857605) internal successors, (845), 618 states have internal predecessors, (845), 144 states have call successors, (144), 58 states have call predecessors, (144), 57 states have return successors, (143), 143 states have call predecessors, (143), 143 states have call successors, (143) [2023-11-29 00:36:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1132 transitions. [2023-11-29 00:36:48,854 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1132 transitions. Word has length 139 [2023-11-29 00:36:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:48,854 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1132 transitions. [2023-11-29 00:36:48,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1132 transitions. [2023-11-29 00:36:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 00:36:48,858 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:48,858 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:48,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 00:36:49,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 00:36:49,059 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:49,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 642394658, now seen corresponding path program 1 times [2023-11-29 00:36:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:49,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269131398] [2023-11-29 00:36:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 00:36:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 00:36:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:36:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-29 00:36:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 00:36:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 00:36:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 00:36:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 00:36:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269131398] [2023-11-29 00:36:49,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269131398] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:49,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689961672] [2023-11-29 00:36:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:49,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:49,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:49,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:36:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:49,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:36:49,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-11-29 00:36:49,988 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689961672] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:49,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-29 00:36:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142719570] [2023-11-29 00:36:49,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:49,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:49,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:49,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:49,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:49,990 INFO L87 Difference]: Start difference. First operand 820 states and 1132 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:51,878 INFO L93 Difference]: Finished difference Result 1275 states and 1754 transitions. [2023-11-29 00:36:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:51,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2023-11-29 00:36:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:51,882 INFO L225 Difference]: With dead ends: 1275 [2023-11-29 00:36:51,882 INFO L226 Difference]: Without dead ends: 467 [2023-11-29 00:36:51,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:51,884 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 6 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:51,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 697 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 00:36:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-11-29 00:36:51,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 462. [2023-11-29 00:36:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 348 states have (on average 1.3505747126436782) internal successors, (470), 348 states have internal predecessors, (470), 78 states have call successors, (78), 36 states have call predecessors, (78), 35 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2023-11-29 00:36:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 625 transitions. [2023-11-29 00:36:51,912 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 625 transitions. Word has length 139 [2023-11-29 00:36:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:51,912 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 625 transitions. [2023-11-29 00:36:51,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:36:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 625 transitions. [2023-11-29 00:36:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-11-29 00:36:51,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:51,914 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:51,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:36:52,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 00:36:52,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:52,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash 209665521, now seen corresponding path program 1 times [2023-11-29 00:36:52,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:52,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753145306] [2023-11-29 00:36:52,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:52,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:36:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 00:36:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 00:36:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 00:36:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:36:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-29 00:36:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 00:36:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-29 00:36:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 00:36:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 00:36:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:52,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753145306] [2023-11-29 00:36:52,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753145306] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:52,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128495815] [2023-11-29 00:36:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:52,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:52,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:52,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:52,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:36:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:53,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 00:36:53,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-29 00:36:53,280 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:53,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128495815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:53,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:53,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-29 00:36:53,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270391996] [2023-11-29 00:36:53,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:53,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:53,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:53,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:53,283 INFO L87 Difference]: Start difference. First operand 462 states and 625 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 00:36:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:54,500 INFO L93 Difference]: Finished difference Result 902 states and 1226 transitions. [2023-11-29 00:36:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:54,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2023-11-29 00:36:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:54,503 INFO L225 Difference]: With dead ends: 902 [2023-11-29 00:36:54,503 INFO L226 Difference]: Without dead ends: 468 [2023-11-29 00:36:54,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:54,505 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 1 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:54,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 692 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:36:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-11-29 00:36:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2023-11-29 00:36:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 352 states have (on average 1.3465909090909092) internal successors, (474), 352 states have internal predecessors, (474), 78 states have call successors, (78), 36 states have call predecessors, (78), 35 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2023-11-29 00:36:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 629 transitions. [2023-11-29 00:36:54,530 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 629 transitions. Word has length 143 [2023-11-29 00:36:54,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:54,530 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 629 transitions. [2023-11-29 00:36:54,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 00:36:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 629 transitions. [2023-11-29 00:36:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-11-29 00:36:54,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:54,532 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:54,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:36:54,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:36:54,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:54,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1519892983, now seen corresponding path program 1 times [2023-11-29 00:36:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876693021] [2023-11-29 00:36:54,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:36:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:36:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 00:36:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 00:36:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:36:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 00:36:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 00:36:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 00:36:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-29 00:36:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876693021] [2023-11-29 00:36:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876693021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635452772] [2023-11-29 00:36:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:55,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:55,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:55,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:36:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:55,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 1239 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 00:36:55,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:55,744 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-29 00:36:55,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:55,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635452772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:55,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:55,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2023-11-29 00:36:55,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472926728] [2023-11-29 00:36:55,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:55,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:36:55,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:55,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:36:55,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:36:55,747 INFO L87 Difference]: Start difference. First operand 466 states and 629 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 00:36:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:36:57,601 INFO L93 Difference]: Finished difference Result 912 states and 1238 transitions. [2023-11-29 00:36:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:36:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 144 [2023-11-29 00:36:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:36:57,605 INFO L225 Difference]: With dead ends: 912 [2023-11-29 00:36:57,605 INFO L226 Difference]: Without dead ends: 466 [2023-11-29 00:36:57,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:36:57,607 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 6 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:36:57,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 676 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 00:36:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-11-29 00:36:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2023-11-29 00:36:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 352 states have (on average 1.3409090909090908) internal successors, (472), 352 states have internal predecessors, (472), 78 states have call successors, (78), 36 states have call predecessors, (78), 35 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2023-11-29 00:36:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 627 transitions. [2023-11-29 00:36:57,650 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 627 transitions. Word has length 144 [2023-11-29 00:36:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:36:57,650 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 627 transitions. [2023-11-29 00:36:57,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 00:36:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 627 transitions. [2023-11-29 00:36:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-11-29 00:36:57,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:36:57,653 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:36:57,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:36:57,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:57,855 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:36:57,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:36:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1201583353, now seen corresponding path program 1 times [2023-11-29 00:36:57,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:36:57,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414962139] [2023-11-29 00:36:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:57,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:36:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:36:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:36:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:36:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:36:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:36:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-29 00:36:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-29 00:36:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:36:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:36:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 00:36:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:36:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 00:36:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-29 00:36:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:36:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-29 00:36:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-29 00:36:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:36:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414962139] [2023-11-29 00:36:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414962139] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:36:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448343915] [2023-11-29 00:36:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:36:58,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:36:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:36:58,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:36:58,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:36:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:36:58,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 00:36:58,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:36:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-11-29 00:36:58,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:36:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448343915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:36:58,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:36:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2023-11-29 00:36:58,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281262617] [2023-11-29 00:36:58,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:36:58,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:36:58,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:36:58,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:36:58,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:36:58,846 INFO L87 Difference]: Start difference. First operand 466 states and 627 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 00:37:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:00,985 INFO L93 Difference]: Finished difference Result 918 states and 1250 transitions. [2023-11-29 00:37:00,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:37:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2023-11-29 00:37:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:00,989 INFO L225 Difference]: With dead ends: 918 [2023-11-29 00:37:00,989 INFO L226 Difference]: Without dead ends: 480 [2023-11-29 00:37:00,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:37:00,991 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 1 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:00,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 923 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 00:37:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-11-29 00:37:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 474. [2023-11-29 00:37:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 358 states have (on average 1.335195530726257) internal successors, (478), 358 states have internal predecessors, (478), 78 states have call successors, (78), 36 states have call predecessors, (78), 37 states have return successors, (87), 79 states have call predecessors, (87), 77 states have call successors, (87) [2023-11-29 00:37:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 643 transitions. [2023-11-29 00:37:01,032 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 643 transitions. Word has length 146 [2023-11-29 00:37:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:01,032 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 643 transitions. [2023-11-29 00:37:01,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 00:37:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 643 transitions. [2023-11-29 00:37:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 00:37:01,035 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:01,035 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:01,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 00:37:01,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:01,236 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:01,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1176486275, now seen corresponding path program 1 times [2023-11-29 00:37:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025963425] [2023-11-29 00:37:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-29 00:37:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 00:37:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-29 00:37:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:37:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 00:37:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 00:37:02,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:02,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025963425] [2023-11-29 00:37:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025963425] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:02,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082021034] [2023-11-29 00:37:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:02,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:02,079 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:37:02,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:37:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:02,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-29 00:37:02,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-29 00:37:02,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:37:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-11-29 00:37:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082021034] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:37:02,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:37:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 16 [2023-11-29 00:37:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788340713] [2023-11-29 00:37:02,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:37:02,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 00:37:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:02,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 00:37:02,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:37:02,892 INFO L87 Difference]: Start difference. First operand 474 states and 643 transitions. Second operand has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (24), 8 states have call predecessors, (24), 4 states have call successors, (24) [2023-11-29 00:37:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:08,477 INFO L93 Difference]: Finished difference Result 940 states and 1284 transitions. [2023-11-29 00:37:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:37:08,478 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (24), 8 states have call predecessors, (24), 4 states have call successors, (24) Word has length 152 [2023-11-29 00:37:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:08,481 INFO L225 Difference]: With dead ends: 940 [2023-11-29 00:37:08,481 INFO L226 Difference]: Without dead ends: 494 [2023-11-29 00:37:08,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:37:08,483 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 125 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:08,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1653 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-11-29 00:37:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-11-29 00:37:08,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 486. [2023-11-29 00:37:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 366 states have (on average 1.3278688524590163) internal successors, (486), 364 states have internal predecessors, (486), 80 states have call successors, (80), 36 states have call predecessors, (80), 39 states have return successors, (95), 85 states have call predecessors, (95), 79 states have call successors, (95) [2023-11-29 00:37:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 661 transitions. [2023-11-29 00:37:08,512 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 661 transitions. Word has length 152 [2023-11-29 00:37:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:08,512 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 661 transitions. [2023-11-29 00:37:08,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.428571428571429) internal successors, (104), 8 states have internal predecessors, (104), 4 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (24), 8 states have call predecessors, (24), 4 states have call successors, (24) [2023-11-29 00:37:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 661 transitions. [2023-11-29 00:37:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 00:37:08,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:08,515 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:08,521 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:37:08,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:37:08,715 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:08,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1296498883, now seen corresponding path program 2 times [2023-11-29 00:37:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026852391] [2023-11-29 00:37:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:37:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 00:37:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 00:37:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 00:37:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 00:37:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-29 00:37:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:09,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026852391] [2023-11-29 00:37:09,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026852391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:09,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:09,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:37:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427918195] [2023-11-29 00:37:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:09,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:37:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:37:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:37:09,530 INFO L87 Difference]: Start difference. First operand 486 states and 661 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 00:37:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:12,384 INFO L93 Difference]: Finished difference Result 725 states and 990 transitions. [2023-11-29 00:37:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:37:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 164 [2023-11-29 00:37:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:12,387 INFO L225 Difference]: With dead ends: 725 [2023-11-29 00:37:12,388 INFO L226 Difference]: Without dead ends: 492 [2023-11-29 00:37:12,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:37:12,389 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 66 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:12,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 985 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 00:37:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-11-29 00:37:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 490. [2023-11-29 00:37:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 370 states have (on average 1.3243243243243243) internal successors, (490), 366 states have internal predecessors, (490), 80 states have call successors, (80), 36 states have call predecessors, (80), 39 states have return successors, (95), 87 states have call predecessors, (95), 79 states have call successors, (95) [2023-11-29 00:37:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 665 transitions. [2023-11-29 00:37:12,430 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 665 transitions. Word has length 164 [2023-11-29 00:37:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:12,430 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 665 transitions. [2023-11-29 00:37:12,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 00:37:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 665 transitions. [2023-11-29 00:37:12,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-29 00:37:12,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:12,434 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:12,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:37:12,434 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:12,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash -268680637, now seen corresponding path program 3 times [2023-11-29 00:37:12,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:12,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667050922] [2023-11-29 00:37:12,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:12,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:37:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:37:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 00:37:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 00:37:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-29 00:37:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-11-29 00:37:13,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667050922] [2023-11-29 00:37:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667050922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:13,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542685335] [2023-11-29 00:37:13,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:37:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:13,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:37:13,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:37:13,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 00:37:13,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:37:13,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 00:37:13,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-11-29 00:37:13,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:37:13,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542685335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:13,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:37:13,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2023-11-29 00:37:13,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581411109] [2023-11-29 00:37:13,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:13,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:37:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:13,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:37:13,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-11-29 00:37:13,717 INFO L87 Difference]: Start difference. First operand 490 states and 665 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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) [2023-11-29 00:37:16,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:37:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:16,143 INFO L93 Difference]: Finished difference Result 727 states and 991 transitions. [2023-11-29 00:37:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:37:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 164 [2023-11-29 00:37:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:16,147 INFO L225 Difference]: With dead ends: 727 [2023-11-29 00:37:16,147 INFO L226 Difference]: Without dead ends: 492 [2023-11-29 00:37:16,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:37:16,148 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:16,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 914 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 00:37:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-11-29 00:37:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2023-11-29 00:37:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 372 states have (on average 1.3225806451612903) internal successors, (492), 368 states have internal predecessors, (492), 80 states have call successors, (80), 36 states have call predecessors, (80), 39 states have return successors, (95), 87 states have call predecessors, (95), 79 states have call successors, (95) [2023-11-29 00:37:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 667 transitions. [2023-11-29 00:37:16,187 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 667 transitions. Word has length 164 [2023-11-29 00:37:16,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:16,188 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 667 transitions. [2023-11-29 00:37:16,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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) [2023-11-29 00:37:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 667 transitions. [2023-11-29 00:37:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-29 00:37:16,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:16,192 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:16,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 00:37:16,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 00:37:16,394 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:16,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:16,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1333054462, now seen corresponding path program 1 times [2023-11-29 00:37:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612502097] [2023-11-29 00:37:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:16,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:37:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 00:37:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 00:37:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:37:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 00:37:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-29 00:37:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-29 00:37:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2023-11-29 00:37:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612502097] [2023-11-29 00:37:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612502097] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124234605] [2023-11-29 00:37:16,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:16,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:16,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:16,916 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:37:16,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:37:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:17,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:37:17,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-11-29 00:37:17,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:37:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124234605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:17,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:37:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-29 00:37:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236649443] [2023-11-29 00:37:17,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:17,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:37:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:17,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:37:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:37:17,615 INFO L87 Difference]: Start difference. First operand 492 states and 667 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 00:37:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:19,551 INFO L93 Difference]: Finished difference Result 1425 states and 1941 transitions. [2023-11-29 00:37:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:37:19,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 192 [2023-11-29 00:37:19,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:19,558 INFO L225 Difference]: With dead ends: 1425 [2023-11-29 00:37:19,558 INFO L226 Difference]: Without dead ends: 1420 [2023-11-29 00:37:19,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:37:19,560 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 400 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:19,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 835 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 00:37:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2023-11-29 00:37:19,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1402. [2023-11-29 00:37:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1058 states have (on average 1.330812854442344) internal successors, (1408), 1048 states have internal predecessors, (1408), 232 states have call successors, (232), 100 states have call predecessors, (232), 111 states have return successors, (279), 253 states have call predecessors, (279), 231 states have call successors, (279) [2023-11-29 00:37:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1919 transitions. [2023-11-29 00:37:19,631 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1919 transitions. Word has length 192 [2023-11-29 00:37:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:19,631 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1919 transitions. [2023-11-29 00:37:19,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 00:37:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1919 transitions. [2023-11-29 00:37:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2023-11-29 00:37:19,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:19,635 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:19,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 00:37:19,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 00:37:19,839 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:19,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:19,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1325835960, now seen corresponding path program 1 times [2023-11-29 00:37:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:19,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926414401] [2023-11-29 00:37:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:19,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:37:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:37:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 00:37:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:37:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 00:37:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 00:37:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 00:37:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2023-11-29 00:37:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:20,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926414401] [2023-11-29 00:37:20,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926414401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:20,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:20,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:37:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859808288] [2023-11-29 00:37:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:20,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 00:37:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 00:37:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 00:37:20,125 INFO L87 Difference]: Start difference. First operand 1402 states and 1919 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:37:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:23,510 INFO L93 Difference]: Finished difference Result 4412 states and 6085 transitions. [2023-11-29 00:37:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:37:23,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 186 [2023-11-29 00:37:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:23,530 INFO L225 Difference]: With dead ends: 4412 [2023-11-29 00:37:23,530 INFO L226 Difference]: Without dead ends: 3038 [2023-11-29 00:37:23,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:37:23,534 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 515 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:23,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1081 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 00:37:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2023-11-29 00:37:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 1408. [2023-11-29 00:37:23,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1064 states have (on average 1.3289473684210527) internal successors, (1414), 1056 states have internal predecessors, (1414), 232 states have call successors, (232), 100 states have call predecessors, (232), 111 states have return successors, (279), 251 states have call predecessors, (279), 231 states have call successors, (279) [2023-11-29 00:37:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1925 transitions. [2023-11-29 00:37:23,726 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1925 transitions. Word has length 186 [2023-11-29 00:37:23,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:23,726 INFO L495 AbstractCegarLoop]: Abstraction has 1408 states and 1925 transitions. [2023-11-29 00:37:23,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 00:37:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1925 transitions. [2023-11-29 00:37:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-11-29 00:37:23,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:23,730 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:23,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:37:23,731 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:23,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash -583646062, now seen corresponding path program 1 times [2023-11-29 00:37:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197506585] [2023-11-29 00:37:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:37:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 00:37:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 00:37:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:37:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 00:37:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2023-11-29 00:37:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-11-29 00:37:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-29 00:37:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2023-11-29 00:37:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:24,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197506585] [2023-11-29 00:37:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197506585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:37:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:37:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:37:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850839221] [2023-11-29 00:37:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:37:24,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:37:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:37:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:37:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:37:24,395 INFO L87 Difference]: Start difference. First operand 1408 states and 1925 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:37:27,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:37:27,206 INFO L93 Difference]: Finished difference Result 2800 states and 3830 transitions. [2023-11-29 00:37:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:37:27,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 198 [2023-11-29 00:37:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:37:27,213 INFO L225 Difference]: With dead ends: 2800 [2023-11-29 00:37:27,213 INFO L226 Difference]: Without dead ends: 1408 [2023-11-29 00:37:27,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:37:27,216 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 37 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 00:37:27,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1114 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 00:37:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-29 00:37:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1408. [2023-11-29 00:37:27,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1064 states have (on average 1.3289473684210527) internal successors, (1414), 1056 states have internal predecessors, (1414), 232 states have call successors, (232), 100 states have call predecessors, (232), 111 states have return successors, (273), 251 states have call predecessors, (273), 231 states have call successors, (273) [2023-11-29 00:37:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1919 transitions. [2023-11-29 00:37:27,350 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1919 transitions. Word has length 198 [2023-11-29 00:37:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:37:27,351 INFO L495 AbstractCegarLoop]: Abstraction has 1408 states and 1919 transitions. [2023-11-29 00:37:27,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 00:37:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1919 transitions. [2023-11-29 00:37:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-11-29 00:37:27,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:37:27,355 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:37:27,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:37:27,356 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:37:27,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:37:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash -953235690, now seen corresponding path program 2 times [2023-11-29 00:37:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:37:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140901852] [2023-11-29 00:37:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:37:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:37:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 00:37:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 00:37:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 00:37:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 00:37:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-29 00:37:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 00:37:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 00:37:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:37:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 00:37:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 00:37:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 00:37:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 00:37:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:37:28,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 00:37:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:37:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-29 00:37:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 00:37:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-29 00:37:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:37:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2023-11-29 00:37:28,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:37:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140901852] [2023-11-29 00:37:28,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140901852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:37:28,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963080610] [2023-11-29 00:37:28,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:37:28,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:37:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:37:28,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:37:28,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:37:28,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:37:28,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:37:28,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 1725 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-29 00:37:28,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:37:28,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2023-11-29 00:37:28,967 INFO L378 Elim1Store]: Elim1 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 7 treesize of output 6 [2023-11-29 00:37:29,403 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 3 [2023-11-29 00:37:37,562 INFO L378 Elim1Store]: Elim1 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 14 treesize of output 3 [2023-11-29 00:37:37,566 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-11-29 00:37:37,676 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2023-11-29 00:37:37,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2023-11-29 00:37:37,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-29 00:37:42,091 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:37:42,092 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-29 00:37:42,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 [2023-11-29 00:37:46,573 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-29 00:37:46,573 INFO L378 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 17 treesize of output 22 [2023-11-29 00:38:03,532 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:38:03,532 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-11-29 00:38:03,762 INFO L378 Elim1Store]: Elim1 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 [2023-11-29 00:38:16,458 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-11-29 00:38:16,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-11-29 00:38:25,011 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 00:38:25,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2023-11-29 00:38:41,921 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-29 00:38:41,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2023-11-29 00:38:50,464 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 00:38:50,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2023-11-29 00:38:54,944 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-29 00:38:54,963 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 10 [2023-11-29 00:39:03,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 00:39:03,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 26 [2023-11-29 00:39:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 80 proven. 83 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-29 00:39:03,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:39:03,970 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1251 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1251) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2023-11-29 00:39:03,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963080610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:39:03,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:39:03,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 39] total 45 [2023-11-29 00:39:03,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313253464] [2023-11-29 00:39:03,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:39:03,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-29 00:39:03,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:39:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-29 00:39:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1953, Unknown=15, NotChecked=90, Total=2256 [2023-11-29 00:39:03,987 INFO L87 Difference]: Start difference. First operand 1408 states and 1919 transitions. Second operand has 45 states, 37 states have (on average 5.702702702702703) internal successors, (211), 31 states have internal predecessors, (211), 17 states have call successors, (45), 12 states have call predecessors, (45), 15 states have return successors, (45), 21 states have call predecessors, (45), 17 states have call successors, (45) [2023-11-29 00:39:08,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:14,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:18,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:22,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:26,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:35,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:40,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:44,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:49,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:39:57,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:01,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:06,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:10,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:14,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:18,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:22,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:26,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:30,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:34,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:38,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:42,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:46,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:50,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:54,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:40:58,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:02,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:06,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:10,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:14,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:18,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:23,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:27,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:31,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:35,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:39,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:43,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:47,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:51,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:55,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:41:59,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:03,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:07,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:12,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:16,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:20,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:24,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:28,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:32,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:36,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:40,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:44,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:48,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:53,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:42:57,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:01,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:05,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:09,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:13,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:17,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:22,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:26,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:30,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:34,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:38,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:42,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:46,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:50,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:54,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:43:58,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:02,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:06,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:10,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:14,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:18,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:22,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:26,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:30,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:34,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:38,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:42,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:46,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:50,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:54,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:44:58,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:02,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:06,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:11,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:15,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:19,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:23,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:27,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:31,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:35,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:39,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:43,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:47,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:51,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:55,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:45:59,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:03,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:07,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:11,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:15,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:19,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:23,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:31,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:35,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:39,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:44,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:48,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:52,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:46:56,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:00,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:04,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:08,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:12,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:16,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:20,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:28,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:32,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:36,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:40,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:44,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:53,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:47:57,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:01,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:05,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:09,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:13,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:18,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:22,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:30,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:35,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:39,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:43,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:47,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:51,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:55,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:48:59,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:49:03,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:49:07,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 00:49:08,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2023-11-29 00:49:08,305 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 00:49:08,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 256 SyntacticMatches, 17 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1948 ImplicationChecksByTransitivity, 112.3s TimeCoverageRelationStatistics Valid=566, Invalid=5271, Unknown=19, NotChecked=150, Total=6006 [2023-11-29 00:49:08,308 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 822 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 2659 mSolverCounterSat, 362 mSolverCounterUnsat, 143 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 580.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 3165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2659 IncrementalHoareTripleChecker+Invalid, 143 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 583.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:49:08,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 2536 Invalid, 3165 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [362 Valid, 2659 Invalid, 143 Unknown, 0 Unchecked, 583.8s Time] [2023-11-29 00:49:08,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:49:08,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 00:49:08,510 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-11-29 00:49:08,513 INFO L158 Benchmark]: Toolchain (without parser) took 771616.91ms. Allocated memory was 169.9MB in the beginning and 285.2MB in the end (delta: 115.3MB). Free memory was 117.9MB in the beginning and 119.5MB in the end (delta: -1.6MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2023-11-29 00:49:08,513 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:49:08,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1101.25ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 117.7MB in the beginning and 172.4MB in the end (delta: -54.7MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. [2023-11-29 00:49:08,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.82ms. Allocated memory is still 232.8MB. Free memory was 172.4MB in the beginning and 166.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 00:49:08,513 INFO L158 Benchmark]: Boogie Preprocessor took 192.55ms. Allocated memory is still 232.8MB. Free memory was 166.1MB in the beginning and 149.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 00:49:08,513 INFO L158 Benchmark]: RCFGBuilder took 1255.35ms. Allocated memory is still 232.8MB. Free memory was 149.3MB in the beginning and 141.6MB in the end (delta: 7.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2023-11-29 00:49:08,514 INFO L158 Benchmark]: TraceAbstraction took 768955.65ms. Allocated memory was 232.8MB in the beginning and 285.2MB in the end (delta: 52.4MB). Free memory was 140.5MB in the beginning and 119.5MB in the end (delta: 21.1MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2023-11-29 00:49:08,514 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1101.25ms. Allocated memory was 169.9MB in the beginning and 232.8MB in the end (delta: 62.9MB). Free memory was 117.7MB in the beginning and 172.4MB in the end (delta: -54.7MB). Peak memory consumption was 72.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.82ms. Allocated memory is still 232.8MB. Free memory was 172.4MB in the beginning and 166.1MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 192.55ms. Allocated memory is still 232.8MB. Free memory was 166.1MB in the beginning and 149.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 1255.35ms. Allocated memory is still 232.8MB. Free memory was 149.3MB in the beginning and 141.6MB in the end (delta: 7.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 768955.65ms. Allocated memory was 232.8MB in the beginning and 285.2MB in the end (delta: 52.4MB). Free memory was 140.5MB in the beginning and 119.5MB in the end (delta: 21.1MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:49:10,220 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:49:10,281 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-29 00:49:10,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:49:10,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:49:10,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:49:10,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:49:10,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:49:10,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:49:10,329 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:49:10,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:49:10,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:49:10,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:49:10,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:49:10,332 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:49:10,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:49:10,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:49:10,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:49:10,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:49:10,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:49:10,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:49:10,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:49:10,336 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:49:10,336 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:49:10,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:49:10,337 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:49:10,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:49:10,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:49:10,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:49:10,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:49:10,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:49:10,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:49:10,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:49:10,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:49:10,340 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:49:10,341 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:49:10,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:49:10,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:49:10,341 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:49:10,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:49:10,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:49:10,342 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:49:10,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/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_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2023-11-29 00:49:10,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:49:10,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:49:10,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:49:10,639 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:49:10,639 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:49:10,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-29 00:49:13,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:49:13,729 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:49:13,730 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-29 00:49:13,755 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data/da1db43b5/e155543ff2f44f269761200048c8787f/FLAGa856eb093 [2023-11-29 00:49:13,768 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/data/da1db43b5/e155543ff2f44f269761200048c8787f [2023-11-29 00:49:13,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:49:13,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:49:13,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:49:13,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:49:13,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:49:13,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:49:13" (1/1) ... [2023-11-29 00:49:13,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2510a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:13, skipping insertion in model container [2023-11-29 00:49:13,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:49:13" (1/1) ... [2023-11-29 00:49:13,866 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:49:14,437 WARN L240 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_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-11-29 00:49:14,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:49:14,501 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 00:49:14,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:49:14,647 WARN L240 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_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-11-29 00:49:14,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:49:14,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:49:14,824 WARN L240 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_be2ab81b-05e7-46de-b092-115f944f41f1/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2023-11-29 00:49:14,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:49:14,869 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:49:14,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14 WrapperNode [2023-11-29 00:49:14,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:49:14,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:49:14,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:49:14,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:49:14,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:14,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:14,983 INFO L138 Inliner]: procedures = 118, calls = 320, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 783 [2023-11-29 00:49:14,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:49:14,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:49:14,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:49:14,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:49:14,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:14,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,075 INFO L175 MemorySlicer]: Split 158 memory accesses to 4 slices as follows [2, 7, 39, 110]. 70 percent of accesses are in the largest equivalence class. The 94 initializations are split as follows [2, 7, 39, 46]. The 21 writes are split as follows [0, 0, 0, 21]. [2023-11-29 00:49:15,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:49:15,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:49:15,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:49:15,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:49:15,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (1/1) ... [2023-11-29 00:49:15,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:49:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:49:15,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:49:15,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:49:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 00:49:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 00:49:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 00:49:15,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 00:49:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-11-29 00:49:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-11-29 00:49:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-11-29 00:49:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-11-29 00:49:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 00:49:15,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 00:49:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 00:49:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 00:49:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-11-29 00:49:15,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-11-29 00:49:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-11-29 00:49:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-11-29 00:49:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 00:49:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 00:49:15,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-29 00:49:15,244 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-29 00:49:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 00:49:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 00:49:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 00:49:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 00:49:15,245 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2023-11-29 00:49:15,245 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2023-11-29 00:49:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2023-11-29 00:49:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2023-11-29 00:49:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 00:49:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 00:49:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2023-11-29 00:49:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2023-11-29 00:49:15,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2023-11-29 00:49:15,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2023-11-29 00:49:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:49:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:49:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 00:49:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:49:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-29 00:49:15,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-29 00:49:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 00:49:15,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 00:49:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 00:49:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 00:49:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2023-11-29 00:49:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2023-11-29 00:49:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2023-11-29 00:49:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2023-11-29 00:49:15,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2023-11-29 00:49:15,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-11-29 00:49:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-11-29 00:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-11-29 00:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 00:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 00:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-29 00:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-29 00:49:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:49:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 00:49:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-11-29 00:49:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-11-29 00:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-11-29 00:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-29 00:49:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-29 00:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:49:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-11-29 00:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-11-29 00:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-11-29 00:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-11-29 00:49:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8#0 [2023-11-29 00:49:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8#1 [2023-11-29 00:49:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8#2 [2023-11-29 00:49:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8#3 [2023-11-29 00:49:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-29 00:49:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-29 00:49:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:49:15,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:49:15,555 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:49:15,558 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:49:15,600 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 00:49:22,540 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:49:22,704 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:49:22,704 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:49:22,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:49:22 BoogieIcfgContainer [2023-11-29 00:49:22,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:49:22,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:49:22,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:49:22,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:49:22,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:49:13" (1/3) ... [2023-11-29 00:49:22,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c031e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:49:22, skipping insertion in model container [2023-11-29 00:49:22,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:49:14" (2/3) ... [2023-11-29 00:49:22,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c031e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:49:22, skipping insertion in model container [2023-11-29 00:49:22,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:49:22" (3/3) ... [2023-11-29 00:49:22,714 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2023-11-29 00:49:22,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:49:22,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:49:22,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:49:22,792 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=LoopHeads, 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;@724e7dce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:49:22,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:49:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 125 states have (on average 1.44) internal successors, (180), 134 states have internal predecessors, (180), 44 states have call successors, (44), 17 states have call predecessors, (44), 16 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-11-29 00:49:22,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:49:22,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:49:22,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:49:22,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:49:22,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:49:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash 347852936, now seen corresponding path program 1 times [2023-11-29 00:49:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:49:22,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917947845] [2023-11-29 00:49:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:49:22,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:49:22,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:49:22,855 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:49:22,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:49:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:49:23,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 00:49:23,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:49:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:23,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:49:23,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:49:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917947845] [2023-11-29 00:49:23,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917947845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:49:23,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:49:23,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:49:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423608010] [2023-11-29 00:49:23,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:49:23,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:49:23,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:49:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:49:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:49:23,229 INFO L87 Difference]: Start difference. First operand has 187 states, 125 states have (on average 1.44) internal successors, (180), 134 states have internal predecessors, (180), 44 states have call successors, (44), 17 states have call predecessors, (44), 16 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:49:27,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:28,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:49:28,854 INFO L93 Difference]: Finished difference Result 371 states and 536 transitions. [2023-11-29 00:49:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:49:28,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-29 00:49:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:49:28,876 INFO L225 Difference]: With dead ends: 371 [2023-11-29 00:49:28,877 INFO L226 Difference]: Without dead ends: 179 [2023-11-29 00:49:28,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:49:28,884 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:49:28,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2023-11-29 00:49:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-29 00:49:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2023-11-29 00:49:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 126 states have internal predecessors, (171), 40 states have call successors, (40), 16 states have call predecessors, (40), 15 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 00:49:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 247 transitions. [2023-11-29 00:49:28,936 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 247 transitions. Word has length 25 [2023-11-29 00:49:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:49:28,936 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 247 transitions. [2023-11-29 00:49:28,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 00:49:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 247 transitions. [2023-11-29 00:49:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:49:28,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:49:28,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:49:28,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:49:29,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:49:29,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:49:29,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:49:29,140 INFO L85 PathProgramCache]: Analyzing trace with hash -673215418, now seen corresponding path program 1 times [2023-11-29 00:49:29,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:49:29,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306044822] [2023-11-29 00:49:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:49:29,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:49:29,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:49:29,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:49:29,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:49:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:49:29,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:49:29,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:49:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:49:29,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:49:29,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:49:29,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306044822] [2023-11-29 00:49:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306044822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:49:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:49:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:49:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906510382] [2023-11-29 00:49:29,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:49:29,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:49:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:49:29,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:49:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:49:29,451 INFO L87 Difference]: Start difference. First operand 179 states and 247 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2023-11-29 00:49:33,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:37,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:41,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:45,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:49:45,523 INFO L93 Difference]: Finished difference Result 511 states and 708 transitions. [2023-11-29 00:49:45,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:49:45,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 25 [2023-11-29 00:49:45,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:49:45,539 INFO L225 Difference]: With dead ends: 511 [2023-11-29 00:49:45,539 INFO L226 Difference]: Without dead ends: 335 [2023-11-29 00:49:45,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:49:45,541 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 220 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:49:45,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 417 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 16.0s Time] [2023-11-29 00:49:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-11-29 00:49:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2023-11-29 00:49:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 232 states have (on average 1.3793103448275863) internal successors, (320), 235 states have internal predecessors, (320), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 00:49:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2023-11-29 00:49:45,580 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 462 transitions. Word has length 25 [2023-11-29 00:49:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:49:45,581 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 462 transitions. [2023-11-29 00:49:45,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2023-11-29 00:49:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 462 transitions. [2023-11-29 00:49:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:49:45,583 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:49:45,584 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:49:45,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:49:45,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:49:45,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:49:45,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:49:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash -455435148, now seen corresponding path program 1 times [2023-11-29 00:49:45,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:49:45,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170498118] [2023-11-29 00:49:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:49:45,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:49:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:49:45,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:49:45,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:49:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:49:46,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:49:46,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:49:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:49:46,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:49:46,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:49:46,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170498118] [2023-11-29 00:49:46,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170498118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:49:46,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:49:46,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:49:46,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870395563] [2023-11-29 00:49:46,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:49:46,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:49:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:49:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:49:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:49:46,131 INFO L87 Difference]: Start difference. First operand 335 states and 462 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-11-29 00:49:50,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:54,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:49:58,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:02,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:05,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:08,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:08,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:50:08,295 INFO L93 Difference]: Finished difference Result 672 states and 928 transitions. [2023-11-29 00:50:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:50:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 [2023-11-29 00:50:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:50:08,310 INFO L225 Difference]: With dead ends: 672 [2023-11-29 00:50:08,310 INFO L226 Difference]: Without dead ends: 348 [2023-11-29 00:50:08,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:50:08,313 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 15 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:50:08,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 623 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 3 Unknown, 0 Unchecked, 22.1s Time] [2023-11-29 00:50:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-29 00:50:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 337. [2023-11-29 00:50:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 234 states have (on average 1.3717948717948718) internal successors, (321), 237 states have internal predecessors, (321), 73 states have call successors, (73), 30 states have call predecessors, (73), 29 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 00:50:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 463 transitions. [2023-11-29 00:50:08,356 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 463 transitions. Word has length 44 [2023-11-29 00:50:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:50:08,356 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 463 transitions. [2023-11-29 00:50:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2023-11-29 00:50:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 463 transitions. [2023-11-29 00:50:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 00:50:08,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:50:08,359 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-29 00:50:08,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:50:08,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:08,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:50:08,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:50:08,564 INFO L85 PathProgramCache]: Analyzing trace with hash -398176846, now seen corresponding path program 1 times [2023-11-29 00:50:08,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:50:08,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402738769] [2023-11-29 00:50:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:50:08,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:50:08,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:50:08,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:50:08,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be2ab81b-05e7-46de-b092-115f944f41f1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:50:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:50:08,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 00:50:08,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:50:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-29 00:50:09,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:50:09,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:50:09,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402738769] [2023-11-29 00:50:09,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402738769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:50:09,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:50:09,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:50:09,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999777453] [2023-11-29 00:50:09,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:50:09,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:50:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:50:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:50:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:50:09,074 INFO L87 Difference]: Start difference. First operand 337 states and 463 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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) [2023-11-29 00:50:13,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:17,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:21,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 00:50:23,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []