./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:01:04,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:01:04,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:01:04,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:01:04,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:01:04,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:01:04,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:01:04,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:01:04,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:01:04,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:01:04,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:01:04,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:01:04,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:01:04,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:01:04,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:01:04,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:01:04,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:01:04,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:01:04,931 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:01:04,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:01:04,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:01:04,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:01:04,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:01:04,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:01:04,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:01:04,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:01:04,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:01:04,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:01:04,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:01:04,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:01:04,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:01:04,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:01:04,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:01:04,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:01:04,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:01:04,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:01:04,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:01:04,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:01:04,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:01:04,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:01:04,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:01:04,984 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:01:05,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:01:05,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:01:05,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:01:05,035 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:01:05,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:01:05,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:01:05,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:01:05,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:01:05,039 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:01:05,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:01:05,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:01:05,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:01:05,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:01:05,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:01:05,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:01:05,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:01:05,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:01:05,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:01:05,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:01:05,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:01:05,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:01:05,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:01:05,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:01:05,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:01:05,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:01:05,046 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:01:05,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:01:05,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:01:05,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:01:05,048 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:01:05,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:01:05,049 INFO L138 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_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/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_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3acbab6b9aaee88273e5c2573b1301b2b4d4059e0d0ec0927c600e9ad855395b [2022-11-25 18:01:05,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:01:05,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:01:05,454 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:01:05,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:01:05,457 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:01:05,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-11-25 18:01:08,711 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:01:09,340 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:01:09,340 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-11-25 18:01:09,389 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/data/97778c185/f364546bfab744a79344bd45f5ee6abe/FLAG53b8682fc [2022-11-25 18:01:09,408 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/data/97778c185/f364546bfab744a79344bd45f5ee6abe [2022-11-25 18:01:09,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:01:09,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:01:09,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:01:09,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:01:09,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:01:09,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:01:09" (1/1) ... [2022-11-25 18:01:09,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f0d881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:09, skipping insertion in model container [2022-11-25 18:01:09,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:01:09" (1/1) ... [2022-11-25 18:01:09,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:01:09,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:01:10,536 WARN L623 FunctionHandler]: Unknown extern function usb_reset_device [2022-11-25 18:01:10,607 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 18:01:10,619 WARN L623 FunctionHandler]: Unknown extern function usbnet_probe [2022-11-25 18:01:10,628 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-11-25 18:01:10,629 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-11-25 18:01:10,631 WARN L623 FunctionHandler]: Unknown extern function usbnet_suspend [2022-11-25 18:01:10,632 WARN L623 FunctionHandler]: Unknown extern function usbnet_resume [2022-11-25 18:01:10,633 WARN L623 FunctionHandler]: Unknown extern function ldv_reset_resume_1 [2022-11-25 18:01:10,647 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-11-25 18:01:10,657 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 18:01:10,657 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-11-25 18:01:10,658 WARN L623 FunctionHandler]: Unknown extern function mutex_trylock [2022-11-25 18:01:10,659 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 18:01:10,663 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 18:01:10,664 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-11-25 18:01:10,665 WARN L623 FunctionHandler]: Unknown extern function __ldv_usb_unlock_device [2022-11-25 18:01:10,666 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 18:01:10,667 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 18:01:10,672 WARN L237 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_cecf2c68-0aea-42e9-914c-cf4f8df4b866/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i[185252,185265] [2022-11-25 18:01:10,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:01:10,970 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:01:11,167 WARN L623 FunctionHandler]: Unknown extern function usb_reset_device [2022-11-25 18:01:11,180 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 18:01:11,185 WARN L623 FunctionHandler]: Unknown extern function usbnet_probe [2022-11-25 18:01:11,188 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-11-25 18:01:11,189 WARN L623 FunctionHandler]: Unknown extern function usbnet_disconnect [2022-11-25 18:01:11,192 WARN L623 FunctionHandler]: Unknown extern function usbnet_suspend [2022-11-25 18:01:11,193 WARN L623 FunctionHandler]: Unknown extern function usbnet_resume [2022-11-25 18:01:11,194 WARN L623 FunctionHandler]: Unknown extern function ldv_reset_resume_1 [2022-11-25 18:01:11,254 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-11-25 18:01:11,254 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 18:01:11,255 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-11-25 18:01:11,255 WARN L623 FunctionHandler]: Unknown extern function mutex_trylock [2022-11-25 18:01:11,256 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 18:01:11,256 WARN L623 FunctionHandler]: Unknown extern function mutex_unlock [2022-11-25 18:01:11,256 WARN L623 FunctionHandler]: Unknown extern function mutex_lock [2022-11-25 18:01:11,257 WARN L623 FunctionHandler]: Unknown extern function __ldv_usb_unlock_device [2022-11-25 18:01:11,258 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 18:01:11,258 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 18:01:11,259 WARN L237 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_cecf2c68-0aea-42e9-914c-cf4f8df4b866/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i[185252,185265] [2022-11-25 18:01:11,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:01:11,381 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:01:11,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11 WrapperNode [2022-11-25 18:01:11,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:01:11,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:01:11,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:01:11,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:01:11,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,564 INFO L138 Inliner]: procedures = 117, calls = 568, calls flagged for inlining = 30, calls inlined = 25, statements flattened = 1081 [2022-11-25 18:01:11,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:01:11,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:01:11,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:01:11,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:01:11,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:01:11,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:01:11,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:01:11,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:01:11,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (1/1) ... [2022-11-25 18:01:11,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:01:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:01:11,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:01:11,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:01:11,799 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-25 18:01:11,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-25 18:01:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:01:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-25 18:01:11,800 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-25 18:01:11,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2022-11-25 18:01:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2022-11-25 18:01:11,801 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-11-25 18:01:11,801 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-11-25 18:01:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-25 18:01:11,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-25 18:01:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-25 18:01:11,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-25 18:01:11,802 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 18:01:11,802 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 18:01:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:01:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:01:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_udev [2022-11-25 18:01:11,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_udev [2022-11-25 18:01:11,803 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-25 18:01:11,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-25 18:01:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:01:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:01:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:01:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:01:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure always_connected [2022-11-25 18:01:11,806 INFO L138 BoogieDeclarations]: Found implementation of procedure always_connected [2022-11-25 18:01:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:01:11,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:01:11,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:01:12,211 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:01:12,214 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:01:12,301 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-25 18:01:13,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:01:13,673 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:01:13,673 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:01:13,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:01:13 BoogieIcfgContainer [2022-11-25 18:01:13,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:01:13,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:01:13,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:01:13,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:01:13,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:01:09" (1/3) ... [2022-11-25 18:01:13,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb6682f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:01:13, skipping insertion in model container [2022-11-25 18:01:13,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:01:11" (2/3) ... [2022-11-25 18:01:13,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb6682f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:01:13, skipping insertion in model container [2022-11-25 18:01:13,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:01:13" (3/3) ... [2022-11-25 18:01:13,703 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--net--usb--cdc_subset.ko-entry_point.cil.out.i [2022-11-25 18:01:13,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:01:13,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:01:13,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:01:13,799 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56ddcf41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:01:13,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:01:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 157 states have internal predecessors, (205), 34 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-11-25 18:01:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-25 18:01:13,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:13,825 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:13,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash 665515163, now seen corresponding path program 1 times [2022-11-25 18:01:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:13,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544781189] [2022-11-25 18:01:13,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:13,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:15,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:15,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:01:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-25 18:01:15,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:15,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544781189] [2022-11-25 18:01:15,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544781189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:15,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:15,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:01:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354490977] [2022-11-25 18:01:15,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:15,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:01:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:15,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:01:15,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:01:15,154 INFO L87 Difference]: Start difference. First operand has 186 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 157 states have internal predecessors, (205), 34 states have call successors, (34), 10 states have call predecessors, (34), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:15,582 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2022-11-25 18:01:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:01:15,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2022-11-25 18:01:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:15,608 INFO L225 Difference]: With dead ends: 367 [2022-11-25 18:01:15,608 INFO L226 Difference]: Without dead ends: 170 [2022-11-25 18:01:15,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:01:15,631 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 26 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:15,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 588 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:01:15,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-25 18:01:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-11-25 18:01:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 141 states have internal predecessors, (188), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-11-25 18:01:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 232 transitions. [2022-11-25 18:01:15,728 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 232 transitions. Word has length 118 [2022-11-25 18:01:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:15,729 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 232 transitions. [2022-11-25 18:01:15,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 232 transitions. [2022-11-25 18:01:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-25 18:01:15,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:15,742 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:01:15,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash -96288345, now seen corresponding path program 1 times [2022-11-25 18:01:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:15,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052815327] [2022-11-25 18:01:15,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:15,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-11-25 18:01:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-25 18:01:16,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:16,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052815327] [2022-11-25 18:01:16,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052815327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:16,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:16,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:01:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542198513] [2022-11-25 18:01:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:16,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:01:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:01:16,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:01:16,534 INFO L87 Difference]: Start difference. First operand 170 states and 232 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:16,912 INFO L93 Difference]: Finished difference Result 435 states and 600 transitions. [2022-11-25 18:01:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:01:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 118 [2022-11-25 18:01:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:16,919 INFO L225 Difference]: With dead ends: 435 [2022-11-25 18:01:16,919 INFO L226 Difference]: Without dead ends: 283 [2022-11-25 18:01:16,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:01:16,925 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 204 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:16,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 718 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:01:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-25 18:01:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 269. [2022-11-25 18:01:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 221 states have (on average 1.420814479638009) internal successors, (314), 226 states have internal predecessors, (314), 34 states have call successors, (34), 14 states have call predecessors, (34), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-25 18:01:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 376 transitions. [2022-11-25 18:01:16,958 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 376 transitions. Word has length 118 [2022-11-25 18:01:16,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:16,958 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 376 transitions. [2022-11-25 18:01:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 376 transitions. [2022-11-25 18:01:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 18:01:16,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:16,961 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:16,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:01:16,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -358901924, now seen corresponding path program 1 times [2022-11-25 18:01:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:16,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21102212] [2022-11-25 18:01:16,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:16,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-25 18:01:17,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:17,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21102212] [2022-11-25 18:01:17,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21102212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:17,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:17,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:01:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052611612] [2022-11-25 18:01:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:17,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:01:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:17,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:01:17,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:01:17,577 INFO L87 Difference]: Start difference. First operand 269 states and 376 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 18:01:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:18,067 INFO L93 Difference]: Finished difference Result 730 states and 1030 transitions. [2022-11-25 18:01:18,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:01:18,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 117 [2022-11-25 18:01:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:18,076 INFO L225 Difference]: With dead ends: 730 [2022-11-25 18:01:18,076 INFO L226 Difference]: Without dead ends: 479 [2022-11-25 18:01:18,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:01:18,082 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 193 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:18,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 816 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:01:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-11-25 18:01:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 475. [2022-11-25 18:01:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 399 states have (on average 1.4335839598997493) internal successors, (572), 404 states have internal predecessors, (572), 52 states have call successors, (52), 24 states have call predecessors, (52), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 18:01:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 670 transitions. [2022-11-25 18:01:18,151 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 670 transitions. Word has length 117 [2022-11-25 18:01:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:18,155 INFO L495 AbstractCegarLoop]: Abstraction has 475 states and 670 transitions. [2022-11-25 18:01:18,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 18:01:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 670 transitions. [2022-11-25 18:01:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-25 18:01:18,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:18,161 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:18,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:01:18,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:18,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:18,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1959898998, now seen corresponding path program 1 times [2022-11-25 18:01:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:18,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687850183] [2022-11-25 18:01:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:18,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-11-25 18:01:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:18,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687850183] [2022-11-25 18:01:18,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687850183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:18,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:18,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:01:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829278239] [2022-11-25 18:01:18,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:18,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:01:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:18,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:01:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:01:18,908 INFO L87 Difference]: Start difference. First operand 475 states and 670 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:19,168 INFO L93 Difference]: Finished difference Result 477 states and 671 transitions. [2022-11-25 18:01:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:01:19,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 137 [2022-11-25 18:01:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:19,175 INFO L225 Difference]: With dead ends: 477 [2022-11-25 18:01:19,175 INFO L226 Difference]: Without dead ends: 474 [2022-11-25 18:01:19,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:01:19,177 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 201 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:19,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 537 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:01:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-25 18:01:19,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2022-11-25 18:01:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 399 states have (on average 1.431077694235589) internal successors, (571), 403 states have internal predecessors, (571), 51 states have call successors, (51), 24 states have call predecessors, (51), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 18:01:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 668 transitions. [2022-11-25 18:01:19,208 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 668 transitions. Word has length 137 [2022-11-25 18:01:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:19,209 INFO L495 AbstractCegarLoop]: Abstraction has 474 states and 668 transitions. [2022-11-25 18:01:19,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 668 transitions. [2022-11-25 18:01:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-11-25 18:01:19,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:19,213 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:01:19,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 627340524, now seen corresponding path program 1 times [2022-11-25 18:01:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044279621] [2022-11-25 18:01:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-11-25 18:01:19,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:19,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044279621] [2022-11-25 18:01:19,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044279621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:19,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:19,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:01:19,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249773823] [2022-11-25 18:01:19,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:19,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:01:19,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:19,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:01:19,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:01:19,895 INFO L87 Difference]: Start difference. First operand 474 states and 668 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:20,110 INFO L93 Difference]: Finished difference Result 476 states and 669 transitions. [2022-11-25 18:01:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:01:20,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 138 [2022-11-25 18:01:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:20,114 INFO L225 Difference]: With dead ends: 476 [2022-11-25 18:01:20,114 INFO L226 Difference]: Without dead ends: 473 [2022-11-25 18:01:20,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:01:20,116 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 218 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:20,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 368 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:01:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-11-25 18:01:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2022-11-25 18:01:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 399 states have (on average 1.4285714285714286) internal successors, (570), 402 states have internal predecessors, (570), 50 states have call successors, (50), 24 states have call predecessors, (50), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 18:01:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 666 transitions. [2022-11-25 18:01:20,146 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 666 transitions. Word has length 138 [2022-11-25 18:01:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:20,147 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 666 transitions. [2022-11-25 18:01:20,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 666 transitions. [2022-11-25 18:01:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 18:01:20,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:20,149 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:20,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:01:20,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2027261639, now seen corresponding path program 1 times [2022-11-25 18:01:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:20,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497740546] [2022-11-25 18:01:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:20,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:20,716 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-11-25 18:01:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497740546] [2022-11-25 18:01:20,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497740546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:20,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:20,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:01:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161257098] [2022-11-25 18:01:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:20,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:01:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:01:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:01:20,720 INFO L87 Difference]: Start difference. First operand 473 states and 666 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:20,946 INFO L93 Difference]: Finished difference Result 475 states and 667 transitions. [2022-11-25 18:01:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:01:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 139 [2022-11-25 18:01:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:20,950 INFO L225 Difference]: With dead ends: 475 [2022-11-25 18:01:20,950 INFO L226 Difference]: Without dead ends: 472 [2022-11-25 18:01:20,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:01:20,952 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 195 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:20,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 529 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:01:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-25 18:01:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2022-11-25 18:01:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 399 states have (on average 1.4260651629072683) internal successors, (569), 401 states have internal predecessors, (569), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 18:01:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 664 transitions. [2022-11-25 18:01:20,981 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 664 transitions. Word has length 139 [2022-11-25 18:01:20,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:20,982 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 664 transitions. [2022-11-25 18:01:20,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 664 transitions. [2022-11-25 18:01:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-25 18:01:20,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:20,985 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:20,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:01:20,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:20,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1579422095, now seen corresponding path program 1 times [2022-11-25 18:01:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:20,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725491069] [2022-11-25 18:01:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-11-25 18:01:21,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:21,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725491069] [2022-11-25 18:01:21,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725491069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:21,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:21,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:01:21,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576734890] [2022-11-25 18:01:21,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:21,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:01:21,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:21,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:01:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:01:21,495 INFO L87 Difference]: Start difference. First operand 472 states and 664 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:21,769 INFO L93 Difference]: Finished difference Result 1334 states and 1900 transitions. [2022-11-25 18:01:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:01:21,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 140 [2022-11-25 18:01:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:21,775 INFO L225 Difference]: With dead ends: 1334 [2022-11-25 18:01:21,775 INFO L226 Difference]: Without dead ends: 886 [2022-11-25 18:01:21,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:01:21,777 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 241 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:21,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 554 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:01:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-25 18:01:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 880. [2022-11-25 18:01:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 751 states have (on average 1.4394141145139814) internal successors, (1081), 753 states have internal predecessors, (1081), 87 states have call successors, (87), 44 states have call predecessors, (87), 41 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2022-11-25 18:01:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1252 transitions. [2022-11-25 18:01:21,829 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1252 transitions. Word has length 140 [2022-11-25 18:01:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:21,829 INFO L495 AbstractCegarLoop]: Abstraction has 880 states and 1252 transitions. [2022-11-25 18:01:21,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-25 18:01:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1252 transitions. [2022-11-25 18:01:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-25 18:01:21,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:21,832 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2022-11-25 18:01:21,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:01:21,833 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1050241138, now seen corresponding path program 1 times [2022-11-25 18:01:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:21,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647440345] [2022-11-25 18:01:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:21,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 18:01:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 18:01:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-11-25 18:01:22,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:22,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647440345] [2022-11-25 18:01:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647440345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:22,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:22,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:01:22,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739159596] [2022-11-25 18:01:22,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:22,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:01:22,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:22,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:01:22,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:01:22,289 INFO L87 Difference]: Start difference. First operand 880 states and 1252 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 18:01:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:22,739 INFO L93 Difference]: Finished difference Result 1730 states and 2467 transitions. [2022-11-25 18:01:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:01:22,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 159 [2022-11-25 18:01:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:22,745 INFO L225 Difference]: With dead ends: 1730 [2022-11-25 18:01:22,745 INFO L226 Difference]: Without dead ends: 882 [2022-11-25 18:01:22,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:01:22,750 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 238 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:22,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1035 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:01:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-11-25 18:01:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 877. [2022-11-25 18:01:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 749 states have (on average 1.4352469959946594) internal successors, (1075), 751 states have internal predecessors, (1075), 86 states have call successors, (86), 43 states have call predecessors, (86), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-11-25 18:01:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1243 transitions. [2022-11-25 18:01:22,814 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1243 transitions. Word has length 159 [2022-11-25 18:01:22,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:22,815 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1243 transitions. [2022-11-25 18:01:22,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 18:01:22,816 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1243 transitions. [2022-11-25 18:01:22,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 18:01:22,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:22,819 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2022-11-25 18:01:22,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:01:22,819 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:22,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 296332059, now seen corresponding path program 1 times [2022-11-25 18:01:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:22,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866018518] [2022-11-25 18:01:22,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:22,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 18:01:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 18:01:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-11-25 18:01:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:23,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866018518] [2022-11-25 18:01:23,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866018518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:23,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:23,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:01:23,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843019359] [2022-11-25 18:01:23,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:23,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:01:23,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:23,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:01:23,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:01:23,906 INFO L87 Difference]: Start difference. First operand 877 states and 1243 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-25 18:01:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:24,500 INFO L93 Difference]: Finished difference Result 2355 states and 3452 transitions. [2022-11-25 18:01:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:01:24,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 164 [2022-11-25 18:01:24,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:24,513 INFO L225 Difference]: With dead ends: 2355 [2022-11-25 18:01:24,513 INFO L226 Difference]: Without dead ends: 1510 [2022-11-25 18:01:24,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:01:24,518 INFO L413 NwaCegarLoop]: 474 mSDtfsCounter, 434 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:24,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 3064 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:01:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2022-11-25 18:01:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 879. [2022-11-25 18:01:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 752 states have (on average 1.4308510638297873) internal successors, (1076), 753 states have internal predecessors, (1076), 85 states have call successors, (85), 43 states have call predecessors, (85), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-11-25 18:01:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1243 transitions. [2022-11-25 18:01:24,617 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1243 transitions. Word has length 164 [2022-11-25 18:01:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:24,618 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1243 transitions. [2022-11-25 18:01:24,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2022-11-25 18:01:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1243 transitions. [2022-11-25 18:01:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-25 18:01:24,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:01:24,625 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:24,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:01:24,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:01:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:01:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1563381600, now seen corresponding path program 1 times [2022-11-25 18:01:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:01:24,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777590875] [2022-11-25 18:01:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:01:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:01:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:01:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:01:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 18:01:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:01:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-25 18:01:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-25 18:01:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-25 18:01:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:01:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 18:01:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 18:01:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-25 18:01:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-25 18:01:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:01:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-11-25 18:01:25,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:01:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777590875] [2022-11-25 18:01:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777590875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:01:25,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:01:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:01:25,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742362535] [2022-11-25 18:01:25,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:01:25,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:01:25,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:01:25,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:01:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:01:25,583 INFO L87 Difference]: Start difference. First operand 879 states and 1243 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:01:26,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:01:26,061 INFO L93 Difference]: Finished difference Result 1190 states and 1736 transitions. [2022-11-25 18:01:26,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:01:26,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 171 [2022-11-25 18:01:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:01:26,063 INFO L225 Difference]: With dead ends: 1190 [2022-11-25 18:01:26,063 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:01:26,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:01:26,066 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 441 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:01:26,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1300 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:01:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:01:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:01:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:01:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:01:26,069 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 171 [2022-11-25 18:01:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:01:26,070 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:01:26,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-25 18:01:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:01:26,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:01:26,075 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:01:26,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:01:26,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:01:28,978 INFO L902 garLoopResultBuilder]: At program point usbnet_disconnectENTRY(lines 7015 7017) the Hoare annotation is: true [2022-11-25 18:01:28,978 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectFINAL(lines 7015 7017) no Hoare annotation was computed. [2022-11-25 18:01:28,978 INFO L899 garLoopResultBuilder]: For program point usbnet_disconnectEXIT(lines 7015 7017) no Hoare annotation was computed. [2022-11-25 18:01:28,978 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevFINAL(lines 6853 6863) no Hoare annotation was computed. [2022-11-25 18:01:28,979 INFO L895 garLoopResultBuilder]: At program point ldv_mutex_lock_udevENTRY(lines 6853 6863) the Hoare annotation is: (or (not (= |old(~ldv_mutex_udev~0)| 1)) (not (= ~ldv_mutex_lock~0 1)) (not (= ~ldv_mutex_i_mutex_of_inode~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0)) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,979 INFO L899 garLoopResultBuilder]: For program point L6856-1(lines 6856 6859) no Hoare annotation was computed. [2022-11-25 18:01:28,979 INFO L899 garLoopResultBuilder]: For program point L6856(lines 6856 6859) no Hoare annotation was computed. [2022-11-25 18:01:28,980 INFO L895 garLoopResultBuilder]: At program point L6857(line 6857) the Hoare annotation is: (or (not (= |old(~ldv_mutex_udev~0)| 1)) (not (= ~ldv_mutex_lock~0 1)) (not (= ~ldv_mutex_i_mutex_of_inode~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0))) [2022-11-25 18:01:28,980 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_udevEXIT(lines 6853 6863) no Hoare annotation was computed. [2022-11-25 18:01:28,980 INFO L899 garLoopResultBuilder]: For program point L5762-1(line 5762) no Hoare annotation was computed. [2022-11-25 18:01:28,980 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocFINAL(lines 5757 5767) no Hoare annotation was computed. [2022-11-25 18:01:28,980 INFO L899 garLoopResultBuilder]: For program point ldv_init_zallocEXIT(lines 5757 5767) no Hoare annotation was computed. [2022-11-25 18:01:28,981 INFO L895 garLoopResultBuilder]: At program point ldv_init_zallocENTRY(lines 5757 5767) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse3 (not (= 1 ~ldv_mutex_mutex_of_device~0))) (.cse4 (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))))) [2022-11-25 18:01:28,981 INFO L899 garLoopResultBuilder]: For program point L5764-1(line 5764) no Hoare annotation was computed. [2022-11-25 18:01:28,981 INFO L895 garLoopResultBuilder]: At program point L5762(line 5762) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse4 (not (= 1 ~ldv_mutex_mutex_of_device~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))))) [2022-11-25 18:01:28,981 INFO L902 garLoopResultBuilder]: At program point L5764(line 5764) the Hoare annotation is: true [2022-11-25 18:01:28,982 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 5720 5722) the Hoare annotation is: true [2022-11-25 18:01:28,982 INFO L899 garLoopResultBuilder]: For program point L5721-2(lines 5720 5722) no Hoare annotation was computed. [2022-11-25 18:01:28,982 INFO L899 garLoopResultBuilder]: For program point L5721(line 5721) no Hoare annotation was computed. [2022-11-25 18:01:28,982 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5720 5722) no Hoare annotation was computed. [2022-11-25 18:01:28,982 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 5776 5783) the Hoare annotation is: true [2022-11-25 18:01:28,982 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 5776 5783) no Hoare annotation was computed. [2022-11-25 18:01:28,983 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 5776 5783) no Hoare annotation was computed. [2022-11-25 18:01:28,983 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6329 6335) no Hoare annotation was computed. [2022-11-25 18:01:28,983 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6329 6335) the Hoare annotation is: true [2022-11-25 18:01:28,983 INFO L899 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6333) no Hoare annotation was computed. [2022-11-25 18:01:28,983 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6329 6335) no Hoare annotation was computed. [2022-11-25 18:01:28,984 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 5792 5798) no Hoare annotation was computed. [2022-11-25 18:01:28,984 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 5792 5798) the Hoare annotation is: true [2022-11-25 18:01:28,984 INFO L899 garLoopResultBuilder]: For program point L6047(lines 6047 6062) no Hoare annotation was computed. [2022-11-25 18:01:28,984 INFO L899 garLoopResultBuilder]: For program point L6080-2(lines 6067 6122) no Hoare annotation was computed. [2022-11-25 18:01:28,984 INFO L899 garLoopResultBuilder]: For program point L6113(lines 6113 6116) no Hoare annotation was computed. [2022-11-25 18:01:28,985 INFO L899 garLoopResultBuilder]: For program point L6080(lines 6080 6085) no Hoare annotation was computed. [2022-11-25 18:01:28,985 INFO L895 garLoopResultBuilder]: At program point L7005(lines 7004 7006) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,985 INFO L899 garLoopResultBuilder]: For program point L6213(line 6213) no Hoare annotation was computed. [2022-11-25 18:01:28,985 INFO L895 garLoopResultBuilder]: At program point L6081(line 6081) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,985 INFO L899 garLoopResultBuilder]: For program point L6081-1(line 6081) no Hoare annotation was computed. [2022-11-25 18:01:28,986 INFO L899 garLoopResultBuilder]: For program point L6973(lines 6964 6982) no Hoare annotation was computed. [2022-11-25 18:01:28,986 INFO L902 garLoopResultBuilder]: At program point L6214(line 6214) the Hoare annotation is: true [2022-11-25 18:01:28,986 INFO L895 garLoopResultBuilder]: At program point L6974(line 6974) the Hoare annotation is: false [2022-11-25 18:01:28,986 INFO L899 garLoopResultBuilder]: For program point L6049(lines 6049 6059) no Hoare annotation was computed. [2022-11-25 18:01:28,986 INFO L899 garLoopResultBuilder]: For program point L6050(line 6050) no Hoare annotation was computed. [2022-11-25 18:01:28,987 INFO L899 garLoopResultBuilder]: For program point L5852(lines 5852 5855) no Hoare annotation was computed. [2022-11-25 18:01:28,987 INFO L899 garLoopResultBuilder]: For program point L6051(lines 6051 6055) no Hoare annotation was computed. [2022-11-25 18:01:28,987 INFO L895 garLoopResultBuilder]: At program point L7009(lines 7008 7010) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,987 INFO L899 garLoopResultBuilder]: For program point L6184(line 6184) no Hoare annotation was computed. [2022-11-25 18:01:28,987 INFO L899 garLoopResultBuilder]: For program point L6052-1(line 6052) no Hoare annotation was computed. [2022-11-25 18:01:28,988 INFO L895 garLoopResultBuilder]: At program point L6052(line 6052) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,988 INFO L895 garLoopResultBuilder]: At program point L5953(lines 5948 5955) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,988 INFO L902 garLoopResultBuilder]: At program point L6977(lines 6962 6983) the Hoare annotation is: true [2022-11-25 18:01:28,988 INFO L899 garLoopResultBuilder]: For program point L6185(lines 6185 6200) no Hoare annotation was computed. [2022-11-25 18:01:28,988 INFO L895 garLoopResultBuilder]: At program point L6978(line 6978) the Hoare annotation is: false [2022-11-25 18:01:28,989 INFO L899 garLoopResultBuilder]: For program point L6945-1(line 6945) no Hoare annotation was computed. [2022-11-25 18:01:28,989 INFO L895 garLoopResultBuilder]: At program point L6945(line 6945) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,989 INFO L895 garLoopResultBuilder]: At program point L6318(lines 6307 6320) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,989 INFO L895 garLoopResultBuilder]: At program point L6087(line 6087) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,989 INFO L899 garLoopResultBuilder]: For program point L6087-1(line 6087) no Hoare annotation was computed. [2022-11-25 18:01:28,990 INFO L895 garLoopResultBuilder]: At program point L6153(lines 6002 6228) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,990 INFO L899 garLoopResultBuilder]: For program point L6120(line 6120) no Hoare annotation was computed. [2022-11-25 18:01:28,990 INFO L899 garLoopResultBuilder]: For program point L6946(lines 6946 6952) no Hoare annotation was computed. [2022-11-25 18:01:28,990 INFO L899 garLoopResultBuilder]: For program point L6187(lines 6187 6197) no Hoare annotation was computed. [2022-11-25 18:01:28,990 INFO L899 garLoopResultBuilder]: For program point L6220(line 6220) no Hoare annotation was computed. [2022-11-25 18:01:28,991 INFO L902 garLoopResultBuilder]: At program point L6121(line 6121) the Hoare annotation is: true [2022-11-25 18:01:28,991 INFO L899 garLoopResultBuilder]: For program point L6947-1(line 6947) no Hoare annotation was computed. [2022-11-25 18:01:28,991 INFO L895 garLoopResultBuilder]: At program point L6947(line 6947) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,991 INFO L895 garLoopResultBuilder]: At program point L7013(lines 7012 7014) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)) [2022-11-25 18:01:28,991 INFO L902 garLoopResultBuilder]: At program point L6221(line 6221) the Hoare annotation is: true [2022-11-25 18:01:28,992 INFO L899 garLoopResultBuilder]: For program point L6188(line 6188) no Hoare annotation was computed. [2022-11-25 18:01:28,992 INFO L895 garLoopResultBuilder]: At program point L5858(lines 5843 5860) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,992 INFO L899 garLoopResultBuilder]: For program point L6189(lines 6189 6193) no Hoare annotation was computed. [2022-11-25 18:01:28,992 INFO L899 garLoopResultBuilder]: For program point L6057(line 6057) no Hoare annotation was computed. [2022-11-25 18:01:28,992 INFO L895 garLoopResultBuilder]: At program point L6223(lines 6002 6228) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,993 INFO L895 garLoopResultBuilder]: At program point L6190(line 6190) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,993 INFO L902 garLoopResultBuilder]: At program point L6058(line 6058) the Hoare annotation is: true [2022-11-25 18:01:28,993 INFO L899 garLoopResultBuilder]: For program point L6190-1(line 6190) no Hoare annotation was computed. [2022-11-25 18:01:28,993 INFO L895 garLoopResultBuilder]: At program point L6950(line 6950) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,993 INFO L899 garLoopResultBuilder]: For program point L6917-1(lines 6917 6920) no Hoare annotation was computed. [2022-11-25 18:01:28,994 INFO L899 garLoopResultBuilder]: For program point L6950-1(line 6950) no Hoare annotation was computed. [2022-11-25 18:01:28,994 INFO L899 garLoopResultBuilder]: For program point L6917(lines 6917 6920) no Hoare annotation was computed. [2022-11-25 18:01:28,994 INFO L895 garLoopResultBuilder]: At program point L6918(line 6918) the Hoare annotation is: false [2022-11-25 18:01:28,994 INFO L895 garLoopResultBuilder]: At program point L6951(lines 6940 6954) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) .cse2 (= 2 ~ldv_mutex_udev~0)) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 1) 0) (= ~ldv_mutex_udev~0 1)))) [2022-11-25 18:01:28,994 INFO L895 garLoopResultBuilder]: At program point L5960(lines 5956 5962) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,995 INFO L899 garLoopResultBuilder]: For program point L6159(line 6159) no Hoare annotation was computed. [2022-11-25 18:01:28,995 INFO L899 garLoopResultBuilder]: For program point L6027(lines 6027 6222) no Hoare annotation was computed. [2022-11-25 18:01:28,995 INFO L899 garLoopResultBuilder]: For program point L6093(line 6093) no Hoare annotation was computed. [2022-11-25 18:01:28,995 INFO L895 garLoopResultBuilder]: At program point L6985(lines 6984 6986) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)) [2022-11-25 18:01:28,995 INFO L899 garLoopResultBuilder]: For program point L6127(line 6127) no Hoare annotation was computed. [2022-11-25 18:01:28,996 INFO L899 garLoopResultBuilder]: For program point L6094(lines 6094 6098) no Hoare annotation was computed. [2022-11-25 18:01:28,996 INFO L902 garLoopResultBuilder]: At program point L6160(line 6160) the Hoare annotation is: true [2022-11-25 18:01:28,996 INFO L899 garLoopResultBuilder]: For program point L6028(line 6028) no Hoare annotation was computed. [2022-11-25 18:01:28,996 INFO L895 garLoopResultBuilder]: At program point L6326(lines 6321 6328) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,996 INFO L902 garLoopResultBuilder]: At program point L6227(lines 5979 6229) the Hoare annotation is: true [2022-11-25 18:01:28,996 INFO L899 garLoopResultBuilder]: For program point L6128(lines 6128 6164) no Hoare annotation was computed. [2022-11-25 18:01:28,997 INFO L899 garLoopResultBuilder]: For program point L6029(lines 6029 6044) no Hoare annotation was computed. [2022-11-25 18:01:28,997 INFO L895 garLoopResultBuilder]: At program point L7020(lines 7019 7021) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,997 INFO L899 garLoopResultBuilder]: For program point L6195(line 6195) no Hoare annotation was computed. [2022-11-25 18:01:28,997 INFO L895 garLoopResultBuilder]: At program point L6922(lines 6914 6924) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,998 INFO L895 garLoopResultBuilder]: At program point L6988(lines 6987 6989) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:28,998 INFO L899 garLoopResultBuilder]: For program point L6130(lines 6130 6161) no Hoare annotation was computed. [2022-11-25 18:01:28,998 INFO L902 garLoopResultBuilder]: At program point L6196(line 6196) the Hoare annotation is: true [2022-11-25 18:01:28,998 INFO L899 garLoopResultBuilder]: For program point L6031(lines 6031 6041) no Hoare annotation was computed. [2022-11-25 18:01:28,998 INFO L899 garLoopResultBuilder]: For program point L6064(line 6064) no Hoare annotation was computed. [2022-11-25 18:01:28,998 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:01:28,999 INFO L895 garLoopResultBuilder]: At program point L6296(lines 6291 6298) the Hoare annotation is: (let ((.cse0 (= 1 ~ldv_mutex_mutex_of_device~0)) (.cse1 (= ~ldv_mutex_i_mutex_of_inode~0 1)) (.cse2 (= ~ldv_mutex_lock~0 1))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 1) 0) (<= (+ |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 1) 0) (= ~ldv_mutex_udev~0 1)) (and .cse0 .cse1 (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) .cse2 (= 2 ~ldv_mutex_udev~0) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0)))) [2022-11-25 18:01:28,999 INFO L899 garLoopResultBuilder]: For program point L6131(line 6131) no Hoare annotation was computed. [2022-11-25 18:01:28,999 INFO L899 garLoopResultBuilder]: For program point L6065(lines 6065 6125) no Hoare annotation was computed. [2022-11-25 18:01:28,999 INFO L899 garLoopResultBuilder]: For program point L6032(line 6032) no Hoare annotation was computed. [2022-11-25 18:01:29,000 INFO L899 garLoopResultBuilder]: For program point L6132(lines 6132 6137) no Hoare annotation was computed. [2022-11-25 18:01:29,000 INFO L899 garLoopResultBuilder]: For program point L6033(lines 6033 6037) no Hoare annotation was computed. [2022-11-25 18:01:29,000 INFO L895 garLoopResultBuilder]: At program point L7024(lines 7023 7025) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,000 INFO L899 garLoopResultBuilder]: For program point L6166(line 6166) no Hoare annotation was computed. [2022-11-25 18:01:29,000 INFO L899 garLoopResultBuilder]: For program point L6067(lines 6067 6122) no Hoare annotation was computed. [2022-11-25 18:01:29,000 INFO L899 garLoopResultBuilder]: For program point L6100(line 6100) no Hoare annotation was computed. [2022-11-25 18:01:29,001 INFO L895 garLoopResultBuilder]: At program point L6959(lines 6955 6961) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,001 INFO L895 garLoopResultBuilder]: At program point L6992(lines 6991 6993) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,001 INFO L899 garLoopResultBuilder]: For program point L6167(lines 6167 6182) no Hoare annotation was computed. [2022-11-25 18:01:29,001 INFO L899 garLoopResultBuilder]: For program point L6101(lines 6101 6108) no Hoare annotation was computed. [2022-11-25 18:01:29,001 INFO L899 garLoopResultBuilder]: For program point L6068(line 6068) no Hoare annotation was computed. [2022-11-25 18:01:29,002 INFO L895 garLoopResultBuilder]: At program point L6003(line 6003) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,002 INFO L899 garLoopResultBuilder]: For program point L6003-1(line 6003) no Hoare annotation was computed. [2022-11-25 18:01:29,002 INFO L899 garLoopResultBuilder]: For program point L6069(lines 6069 6077) no Hoare annotation was computed. [2022-11-25 18:01:29,002 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:01:29,002 INFO L899 garLoopResultBuilder]: For program point L6202(line 6202) no Hoare annotation was computed. [2022-11-25 18:01:29,003 INFO L899 garLoopResultBuilder]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2022-11-25 18:01:29,003 INFO L899 garLoopResultBuilder]: For program point L6169(lines 6169 6179) no Hoare annotation was computed. [2022-11-25 18:01:29,003 INFO L895 garLoopResultBuilder]: At program point L7028(lines 7027 7029) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,003 INFO L895 garLoopResultBuilder]: At program point L5773(lines 5768 5775) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,003 INFO L899 garLoopResultBuilder]: For program point L6203(lines 6203 6218) no Hoare annotation was computed. [2022-11-25 18:01:29,004 INFO L899 garLoopResultBuilder]: For program point L6170(line 6170) no Hoare annotation was computed. [2022-11-25 18:01:29,004 INFO L899 garLoopResultBuilder]: For program point L6071(lines 6071 6075) no Hoare annotation was computed. [2022-11-25 18:01:29,004 INFO L895 garLoopResultBuilder]: At program point L6005(line 6005) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,004 INFO L899 garLoopResultBuilder]: For program point L6005-1(line 6005) no Hoare annotation was computed. [2022-11-25 18:01:29,004 INFO L899 garLoopResultBuilder]: For program point L6171(lines 6171 6175) no Hoare annotation was computed. [2022-11-25 18:01:29,005 INFO L899 garLoopResultBuilder]: For program point L6039(line 6039) no Hoare annotation was computed. [2022-11-25 18:01:29,005 INFO L895 garLoopResultBuilder]: At program point L6304(lines 6299 6306) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= |ULTIMATE.start_m5632_recover_~r~0#1| 0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_udev_#res#1| 0) (= ~ldv_mutex_lock~0 1) (= |ULTIMATE.start_ldv_usb_lock_device_for_reset_12_#res#1| 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,005 INFO L899 garLoopResultBuilder]: For program point L6139(line 6139) no Hoare annotation was computed. [2022-11-25 18:01:29,005 INFO L899 garLoopResultBuilder]: For program point L6172-1(line 6172) no Hoare annotation was computed. [2022-11-25 18:01:29,005 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:01:29,006 INFO L899 garLoopResultBuilder]: For program point L6205(lines 6205 6215) no Hoare annotation was computed. [2022-11-25 18:01:29,006 INFO L895 garLoopResultBuilder]: At program point L6172(line 6172) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,006 INFO L895 garLoopResultBuilder]: At program point L6007(line 6007) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,006 INFO L899 garLoopResultBuilder]: For program point L6007-1(line 6007) no Hoare annotation was computed. [2022-11-25 18:01:29,006 INFO L895 garLoopResultBuilder]: At program point L5974(line 5974) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,007 INFO L902 garLoopResultBuilder]: At program point L6040(line 6040) the Hoare annotation is: true [2022-11-25 18:01:29,007 INFO L899 garLoopResultBuilder]: For program point L5974-1(line 5974) no Hoare annotation was computed. [2022-11-25 18:01:29,007 INFO L899 garLoopResultBuilder]: For program point L6965-1(lines 6964 6982) no Hoare annotation was computed. [2022-11-25 18:01:29,007 INFO L899 garLoopResultBuilder]: For program point L6965(lines 6965 6968) no Hoare annotation was computed. [2022-11-25 18:01:29,007 INFO L899 garLoopResultBuilder]: For program point L6206(line 6206) no Hoare annotation was computed. [2022-11-25 18:01:29,007 INFO L899 garLoopResultBuilder]: For program point L6140(lines 6140 6157) no Hoare annotation was computed. [2022-11-25 18:01:29,008 INFO L895 garLoopResultBuilder]: At program point L6966(line 6966) the Hoare annotation is: false [2022-11-25 18:01:29,008 INFO L899 garLoopResultBuilder]: For program point L6207(lines 6207 6211) no Hoare annotation was computed. [2022-11-25 18:01:29,008 INFO L895 garLoopResultBuilder]: At program point L6009(line 6009) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,008 INFO L899 garLoopResultBuilder]: For program point L6009-1(line 6009) no Hoare annotation was computed. [2022-11-25 18:01:29,008 INFO L895 garLoopResultBuilder]: At program point L5976(lines 5970 5978) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,009 INFO L899 garLoopResultBuilder]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2022-11-25 18:01:29,009 INFO L899 garLoopResultBuilder]: For program point L6142(lines 6142 6150) no Hoare annotation was computed. [2022-11-25 18:01:29,009 INFO L895 garLoopResultBuilder]: At program point L6208(line 6208) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,009 INFO L899 garLoopResultBuilder]: For program point L6142-2(lines 6140 6156) no Hoare annotation was computed. [2022-11-25 18:01:29,009 INFO L899 garLoopResultBuilder]: For program point L6110(line 6110) no Hoare annotation was computed. [2022-11-25 18:01:29,010 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:01:29,010 INFO L895 garLoopResultBuilder]: At program point L6011(line 6011) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,010 INFO L895 garLoopResultBuilder]: At program point L-1-2(line -1) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,010 INFO L899 garLoopResultBuilder]: For program point L6011-1(line 6011) no Hoare annotation was computed. [2022-11-25 18:01:29,010 INFO L899 garLoopResultBuilder]: For program point L-1-3(line -1) no Hoare annotation was computed. [2022-11-25 18:01:29,011 INFO L899 garLoopResultBuilder]: For program point L6969(lines 6964 6982) no Hoare annotation was computed. [2022-11-25 18:01:29,011 INFO L899 garLoopResultBuilder]: For program point L6111(lines 6111 6118) no Hoare annotation was computed. [2022-11-25 18:01:29,011 INFO L899 garLoopResultBuilder]: For program point L6177(line 6177) no Hoare annotation was computed. [2022-11-25 18:01:29,011 INFO L895 garLoopResultBuilder]: At program point L6970(line 6970) the Hoare annotation is: false [2022-11-25 18:01:29,011 INFO L902 garLoopResultBuilder]: At program point L6178(line 6178) the Hoare annotation is: true [2022-11-25 18:01:29,011 INFO L899 garLoopResultBuilder]: For program point L6079(line 6079) no Hoare annotation was computed. [2022-11-25 18:01:29,012 INFO L899 garLoopResultBuilder]: For program point L6046(line 6046) no Hoare annotation was computed. [2022-11-25 18:01:29,012 INFO L895 garLoopResultBuilder]: At program point L6013(line 6013) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_i_mutex_of_inode~0 1) (= ~ldv_mutex_lock~0 1) (= ~ldv_state_variable_6~0 0) (= ~ldv_mutex_udev~0 1)) [2022-11-25 18:01:29,012 INFO L899 garLoopResultBuilder]: For program point L6013-1(line 6013) no Hoare annotation was computed. [2022-11-25 18:01:29,012 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_mutex_lock~0 1))) (.cse1 (not (= ~ldv_mutex_udev~0 1))) (.cse2 (= |#memory_int| |old(#memory_int)|)) (.cse3 (not (= ~ldv_mutex_i_mutex_of_inode~0 1))) (.cse4 (not (= 1 ~ldv_mutex_mutex_of_device~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_6~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~ldv_state_variable_0~0 1))))) [2022-11-25 18:01:29,012 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:01:29,013 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:01:29,013 INFO L902 garLoopResultBuilder]: At program point always_connectedENTRY(lines 5837 5842) the Hoare annotation is: true [2022-11-25 18:01:29,013 INFO L899 garLoopResultBuilder]: For program point always_connectedFINAL(lines 5837 5842) no Hoare annotation was computed. [2022-11-25 18:01:29,013 INFO L899 garLoopResultBuilder]: For program point always_connectedEXIT(lines 5837 5842) no Hoare annotation was computed. [2022-11-25 18:01:29,013 INFO L902 garLoopResultBuilder]: At program point ldv_undef_int_negativeENTRY(lines 6336 6349) the Hoare annotation is: true [2022-11-25 18:01:29,014 INFO L899 garLoopResultBuilder]: For program point L6343-1(lines 6343 6346) no Hoare annotation was computed. [2022-11-25 18:01:29,014 INFO L899 garLoopResultBuilder]: For program point L6343(lines 6343 6346) no Hoare annotation was computed. [2022-11-25 18:01:29,014 INFO L902 garLoopResultBuilder]: At program point L6344(line 6344) the Hoare annotation is: true [2022-11-25 18:01:29,014 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeFINAL(lines 6336 6349) no Hoare annotation was computed. [2022-11-25 18:01:29,014 INFO L899 garLoopResultBuilder]: For program point L6341-1(line 6341) no Hoare annotation was computed. [2022-11-25 18:01:29,014 INFO L899 garLoopResultBuilder]: For program point ldv_undef_int_negativeEXIT(lines 6336 6349) no Hoare annotation was computed. [2022-11-25 18:01:29,015 INFO L902 garLoopResultBuilder]: At program point L6341(line 6341) the Hoare annotation is: true [2022-11-25 18:01:29,018 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:01:29,021 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:01:29,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:01:29 BoogieIcfgContainer [2022-11-25 18:01:29,042 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:01:29,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:01:29,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:01:29,043 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:01:29,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:01:13" (3/4) ... [2022-11-25 18:01:29,047 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:01:29,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usbnet_disconnect [2022-11-25 18:01:29,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-11-25 18:01:29,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_udev [2022-11-25 18:01:29,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-11-25 18:01:29,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2022-11-25 18:01:29,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-11-25 18:01:29,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2022-11-25 18:01:29,056 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2022-11-25 18:01:29,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure always_connected [2022-11-25 18:01:29,057 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int_negative [2022-11-25 18:01:29,073 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-11-25 18:01:29,075 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2022-11-25 18:01:29,077 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 18:01:29,078 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:01:29,080 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:01:29,116 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-11-25 18:01:29,116 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-11-25 18:01:29,116 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ldv_mutex_udev == 1) [2022-11-25 18:01:29,117 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 [2022-11-25 18:01:29,117 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) [2022-11-25 18:01:29,119 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 [2022-11-25 18:01:29,120 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 [2022-11-25 18:01:29,365 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:01:29,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:01:29,366 INFO L158 Benchmark]: Toolchain (without parser) took 19953.80ms. Allocated memory was 146.8MB in the beginning and 406.8MB in the end (delta: 260.0MB). Free memory was 97.0MB in the beginning and 184.9MB in the end (delta: -87.9MB). Peak memory consumption was 172.1MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,367 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 109.1MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:01:29,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1967.45ms. Allocated memory is still 146.8MB. Free memory was 96.5MB in the beginning and 89.5MB in the end (delta: 7.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 181.89ms. Allocated memory is still 146.8MB. Free memory was 89.5MB in the beginning and 81.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,368 INFO L158 Benchmark]: Boogie Preprocessor took 133.73ms. Allocated memory is still 146.8MB. Free memory was 81.8MB in the beginning and 72.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,368 INFO L158 Benchmark]: RCFGBuilder took 1976.44ms. Allocated memory was 146.8MB in the beginning and 228.6MB in the end (delta: 81.8MB). Free memory was 72.1MB in the beginning and 97.3MB in the end (delta: -25.2MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,369 INFO L158 Benchmark]: TraceAbstraction took 15362.14ms. Allocated memory was 228.6MB in the beginning and 406.8MB in the end (delta: 178.3MB). Free memory was 97.3MB in the beginning and 216.2MB in the end (delta: -118.9MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,369 INFO L158 Benchmark]: Witness Printer took 322.98ms. Allocated memory is still 406.8MB. Free memory was 216.2MB in the beginning and 184.9MB in the end (delta: 31.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 18:01:29,371 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 109.1MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1967.45ms. Allocated memory is still 146.8MB. Free memory was 96.5MB in the beginning and 89.5MB in the end (delta: 7.0MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 181.89ms. Allocated memory is still 146.8MB. Free memory was 89.5MB in the beginning and 81.8MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.73ms. Allocated memory is still 146.8MB. Free memory was 81.8MB in the beginning and 72.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1976.44ms. Allocated memory was 146.8MB in the beginning and 228.6MB in the end (delta: 81.8MB). Free memory was 72.1MB in the beginning and 97.3MB in the end (delta: -25.2MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15362.14ms. Allocated memory was 228.6MB in the beginning and 406.8MB in the end (delta: 178.3MB). Free memory was 97.3MB in the beginning and 216.2MB in the end (delta: -118.9MB). Peak memory consumption was 173.6MB. Max. memory is 16.1GB. * Witness Printer took 322.98ms. Allocated memory is still 406.8MB. Free memory was 216.2MB in the beginning and 184.9MB in the end (delta: 31.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 187 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2470 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2391 mSDsluCounter, 9509 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6892 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1400 IncrementalHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 2617 mSDtfsCounter, 1400 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=880occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 660 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 70 LocationsWithAnnotation, 567 PreInvPairs, 725 NumberOfFragments, 882 HoareAnnotationTreeSize, 567 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 70 FomulaSimplificationsInter, 7028 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 2506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2713/2713 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7008]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7019]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7027]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5970]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6914]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6299]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6955]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && \result == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 5956]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6987]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5979]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5792]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) || ((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && ldv_mutex_udev == 1) - InvariantResult [Line: 6984]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 - InvariantResult [Line: 7023]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7004]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5843]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6002]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 6321]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 5768]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6962]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6307]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: (((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_state_variable_6 == 0) && ldv_mutex_udev == 1 - InvariantResult [Line: 6291]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && \result + 1 <= 0) && \result + 1 <= 0) && ldv_mutex_udev == 1) || (((((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0) - InvariantResult [Line: 6991]: Loop Invariant Derived loop invariant: ((1 == ldv_mutex_mutex_of_device && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 - InvariantResult [Line: 7012]: Loop Invariant Derived loop invariant: (((((1 == ldv_mutex_mutex_of_device && r == 0) && ldv_mutex_i_mutex_of_inode == 1) && \result == 0) && ldv_mutex_lock == 1) && 2 == ldv_mutex_udev) && \result == 0 - InvariantResult [Line: 5948]: Loop Invariant Derived loop invariant: (((ldv_state_variable_0 == 1 && 1 == ldv_mutex_mutex_of_device) && ldv_mutex_i_mutex_of_inode == 1) && ldv_mutex_lock == 1) && ldv_mutex_udev == 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 18:01:29,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cecf2c68-0aea-42e9-914c-cf4f8df4b866/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE