./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN --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 d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 --- 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-6b4ec56 [2022-11-20 12:44:45,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:44:45,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:44:45,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:44:45,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:44:45,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:44:45,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:44:45,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:44:45,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:44:45,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:44:45,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:44:45,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:44:45,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:44:45,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:44:45,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:44:45,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:44:45,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:44:45,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:44:45,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:44:45,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:44:45,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:44:45,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:44:45,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:44:45,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:44:45,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:44:45,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:44:45,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:44:45,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:44:45,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:44:45,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:44:45,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:44:45,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:44:45,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:44:45,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:44:45,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:44:45,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:44:45,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:44:45,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:44:45,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:44:45,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:44:45,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:44:45,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 12:44:45,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:44:45,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:44:45,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:44:45,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:44:45,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:44:45,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:44:45,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:44:45,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:44:45,703 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:44:45,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:44:45,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:44:45,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:44:45,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:44:45,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:44:45,706 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:44:45,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:44:45,707 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:44:45,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:44:45,707 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:44:45,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:44:45,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:44:45,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:44:45,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:44:45,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:44:45,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:44:45,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:44:45,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:44:45,710 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:44:45,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:44:45,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:44:45,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/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_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN 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 -> d9b118296c3c6ba241fa831bfdb5289a0072e9871a56ce58ee16beb68bb5aa55 [2022-11-20 12:44:46,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:44:46,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:44:46,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:44:46,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:44:46,154 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:44:46,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-11-20 12:44:49,558 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:44:50,150 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:44:50,151 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-11-20 12:44:50,197 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/data/083528ce9/9a7b976c03f044ba89220dffe40dbdab/FLAGeba41620d [2022-11-20 12:44:50,220 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/data/083528ce9/9a7b976c03f044ba89220dffe40dbdab [2022-11-20 12:44:50,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:44:50,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:44:50,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:44:50,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:44:50,235 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:44:50,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:50" (1/1) ... [2022-11-20 12:44:50,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37eef368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:50, skipping insertion in model container [2022-11-20 12:44:50,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:50" (1/1) ... [2022-11-20 12:44:50,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:44:50,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:44:51,365 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_33a57047-67a6-4646-8fa1-591a04d34972/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2022-11-20 12:44:51,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:44:51,497 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:44:51,889 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_33a57047-67a6-4646-8fa1-591a04d34972/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i[146121,146134] [2022-11-20 12:44:51,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:44:51,980 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:44:51,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51 WrapperNode [2022-11-20 12:44:51,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:44:51,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:44:51,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:44:51,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:44:51,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,125 INFO L138 Inliner]: procedures = 81, calls = 518, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 1696 [2022-11-20 12:44:52,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:44:52,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:44:52,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:44:52,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:44:52,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,188 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,207 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:44:52,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:44:52,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:44:52,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:44:52,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (1/1) ... [2022-11-20 12:44:52,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:44:52,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:44:52,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:44:52,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:44:52,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:44:52,317 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2022-11-20 12:44:52,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2022-11-20 12:44:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 12:44:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2022-11-20 12:44:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2022-11-20 12:44:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:44:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 12:44:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-20 12:44:52,319 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-20 12:44:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-20 12:44:52,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-20 12:44:52,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 12:44:52,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 12:44:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-20 12:44:52,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-20 12:44:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:44:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 12:44:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 12:44:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 12:44:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:44:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2022-11-20 12:44:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2022-11-20 12:44:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-20 12:44:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-20 12:44:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-20 12:44:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-20 12:44:52,322 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2022-11-20 12:44:52,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2022-11-20 12:44:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-20 12:44:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-20 12:44:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2022-11-20 12:44:52,323 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2022-11-20 12:44:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:44:52,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 12:44:52,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:44:52,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:44:52,705 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:44:52,707 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:44:52,717 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-20 12:44:52,805 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-11-20 12:44:52,806 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-11-20 12:44:52,937 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-20 12:44:52,955 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-20 12:44:52,961 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-20 12:44:52,983 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-20 12:44:54,730 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##74: assume !false; [2022-11-20 12:44:54,730 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##73: assume false; [2022-11-20 12:44:54,731 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2022-11-20 12:44:54,731 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2022-11-20 12:44:54,731 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-11-20 12:44:54,731 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-11-20 12:44:54,743 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:44:54,771 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:44:54,772 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2022-11-20 12:44:54,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:54 BoogieIcfgContainer [2022-11-20 12:44:54,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:44:54,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:44:54,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:44:54,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:44:54,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:44:50" (1/3) ... [2022-11-20 12:44:54,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e41fcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:44:54, skipping insertion in model container [2022-11-20 12:44:54,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:51" (2/3) ... [2022-11-20 12:44:54,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e41fcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:44:54, skipping insertion in model container [2022-11-20 12:44:54,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:54" (3/3) ... [2022-11-20 12:44:54,797 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2022-11-20 12:44:54,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:44:54,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 12:44:54,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:44:54,930 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;@5bee3568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:44:54,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 12:44:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-20 12:44:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:44:54,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:44:54,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:44:54,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:44:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:44:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash -248243768, now seen corresponding path program 1 times [2022-11-20 12:44:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:44:54,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372348240] [2022-11-20 12:44:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:44:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:44:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:44:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:44:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:44:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:44:56,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:44:56,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372348240] [2022-11-20 12:44:56,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372348240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:44:56,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:44:56,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:44:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752121249] [2022-11-20 12:44:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:44:56,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:44:56,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:44:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:44:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:44:56,563 INFO L87 Difference]: Start difference. First operand has 301 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 272 states have internal predecessors, (395), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:44:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:44:58,085 INFO L93 Difference]: Finished difference Result 845 states and 1261 transitions. [2022-11-20 12:44:58,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:44:58,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-20 12:44:58,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:44:58,104 INFO L225 Difference]: With dead ends: 845 [2022-11-20 12:44:58,104 INFO L226 Difference]: Without dead ends: 538 [2022-11-20 12:44:58,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:44:58,112 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 467 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:44:58,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1202 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 12:44:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-11-20 12:44:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 528. [2022-11-20 12:44:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 469 states have (on average 1.3411513859275053) internal successors, (629), 478 states have internal predecessors, (629), 38 states have call successors, (38), 21 states have call predecessors, (38), 20 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 12:44:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 702 transitions. [2022-11-20 12:44:58,205 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 702 transitions. Word has length 18 [2022-11-20 12:44:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:44:58,205 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 702 transitions. [2022-11-20 12:44:58,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:44:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 702 transitions. [2022-11-20 12:44:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 12:44:58,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:44:58,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:44:58,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:44:58,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:44:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:44:58,209 INFO L85 PathProgramCache]: Analyzing trace with hash -835049782, now seen corresponding path program 1 times [2022-11-20 12:44:58,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:44:58,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106786243] [2022-11-20 12:44:58,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:44:58,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:44:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:44:58,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:44:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:44:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:44:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:44:58,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106786243] [2022-11-20 12:44:58,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106786243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:44:58,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:44:58,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:44:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74490773] [2022-11-20 12:44:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:44:58,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:44:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:44:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:44:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:44:58,507 INFO L87 Difference]: Start difference. First operand 528 states and 702 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:44:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:44:59,399 INFO L93 Difference]: Finished difference Result 1543 states and 2060 transitions. [2022-11-20 12:44:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:44:59,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-20 12:44:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:44:59,406 INFO L225 Difference]: With dead ends: 1543 [2022-11-20 12:44:59,406 INFO L226 Difference]: Without dead ends: 1033 [2022-11-20 12:44:59,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:44:59,410 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 474 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:44:59,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 836 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 12:44:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2022-11-20 12:44:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1020. [2022-11-20 12:44:59,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 913 states have (on average 1.343921139101862) internal successors, (1227), 926 states have internal predecessors, (1227), 69 states have call successors, (69), 38 states have call predecessors, (69), 37 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-20 12:44:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1362 transitions. [2022-11-20 12:44:59,495 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1362 transitions. Word has length 18 [2022-11-20 12:44:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:44:59,495 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 1362 transitions. [2022-11-20 12:44:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:44:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1362 transitions. [2022-11-20 12:44:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 12:44:59,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:44:59,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:44:59,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:44:59,497 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:44:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:44:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash -116851219, now seen corresponding path program 1 times [2022-11-20 12:44:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:44:59,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259323487] [2022-11-20 12:44:59,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:44:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:44:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:44:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:44:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:44:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:44:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:44:59,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259323487] [2022-11-20 12:44:59,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259323487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:44:59,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:44:59,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:44:59,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839743354] [2022-11-20 12:44:59,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:44:59,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:44:59,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:44:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:44:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:44:59,776 INFO L87 Difference]: Start difference. First operand 1020 states and 1362 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:45:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:00,304 INFO L93 Difference]: Finished difference Result 1022 states and 1363 transitions. [2022-11-20 12:45:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:45:00,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-20 12:45:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:00,322 INFO L225 Difference]: With dead ends: 1022 [2022-11-20 12:45:00,323 INFO L226 Difference]: Without dead ends: 1001 [2022-11-20 12:45:00,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:45:00,325 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 421 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:00,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 530 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:45:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2022-11-20 12:45:00,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2022-11-20 12:45:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3414634146341464) internal successors, (1210), 912 states have internal predecessors, (1210), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-11-20 12:45:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1336 transitions. [2022-11-20 12:45:00,399 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1336 transitions. Word has length 19 [2022-11-20 12:45:00,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:00,400 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1336 transitions. [2022-11-20 12:45:00,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 12:45:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1336 transitions. [2022-11-20 12:45:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 12:45:00,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:00,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:45:00,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:45:00,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash -470649452, now seen corresponding path program 1 times [2022-11-20 12:45:00,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:00,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537679432] [2022-11-20 12:45:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 12:45:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:01,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:01,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537679432] [2022-11-20 12:45:01,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537679432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:01,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:01,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:45:01,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521393477] [2022-11-20 12:45:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:01,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:45:01,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:01,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:45:01,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:45:01,251 INFO L87 Difference]: Start difference. First operand 1001 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 12:45:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:02,597 INFO L93 Difference]: Finished difference Result 2037 states and 2716 transitions. [2022-11-20 12:45:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:45:02,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-11-20 12:45:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:02,605 INFO L225 Difference]: With dead ends: 2037 [2022-11-20 12:45:02,605 INFO L226 Difference]: Without dead ends: 1057 [2022-11-20 12:45:02,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:45:02,620 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 715 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:02,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 1152 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 12:45:02,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2022-11-20 12:45:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1001. [2022-11-20 12:45:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 902 states have (on average 1.3392461197339247) internal successors, (1208), 912 states have internal predecessors, (1208), 64 states have call successors, (64), 35 states have call predecessors, (64), 34 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2022-11-20 12:45:02,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1334 transitions. [2022-11-20 12:45:02,702 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1334 transitions. Word has length 76 [2022-11-20 12:45:02,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:02,703 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1334 transitions. [2022-11-20 12:45:02,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 12:45:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1334 transitions. [2022-11-20 12:45:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 12:45:02,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:02,707 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:45:02,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:45:02,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:02,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -26748778, now seen corresponding path program 1 times [2022-11-20 12:45:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:02,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757484804] [2022-11-20 12:45:02,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:02,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 12:45:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:03,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:03,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757484804] [2022-11-20 12:45:03,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757484804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:03,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:45:03,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548324262] [2022-11-20 12:45:03,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:03,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:03,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:03,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:45:03,304 INFO L87 Difference]: Start difference. First operand 1001 states and 1334 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:45:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:04,534 INFO L93 Difference]: Finished difference Result 3001 states and 4072 transitions. [2022-11-20 12:45:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:45:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 76 [2022-11-20 12:45:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:04,546 INFO L225 Difference]: With dead ends: 3001 [2022-11-20 12:45:04,546 INFO L226 Difference]: Without dead ends: 2021 [2022-11-20 12:45:04,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:04,550 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 656 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:04,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 2683 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-11-20 12:45:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 977. [2022-11-20 12:45:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 887 states have (on average 1.3370913190529876) internal successors, (1186), 893 states have internal predecessors, (1186), 57 states have call successors, (57), 33 states have call predecessors, (57), 32 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2022-11-20 12:45:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1298 transitions. [2022-11-20 12:45:04,661 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1298 transitions. Word has length 76 [2022-11-20 12:45:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:04,662 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 1298 transitions. [2022-11-20 12:45:04,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:45:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1298 transitions. [2022-11-20 12:45:04,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 12:45:04,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:04,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:04,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:45:04,666 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:04,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:04,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1980008620, now seen corresponding path program 1 times [2022-11-20 12:45:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:04,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572391848] [2022-11-20 12:45:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 12:45:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:45:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:05,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572391848] [2022-11-20 12:45:05,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572391848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:05,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:05,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:45:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443988487] [2022-11-20 12:45:05,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:05,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:45:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:45:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:45:05,523 INFO L87 Difference]: Start difference. First operand 977 states and 1298 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:45:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:07,006 INFO L93 Difference]: Finished difference Result 2238 states and 3026 transitions. [2022-11-20 12:45:07,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:45:07,007 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-11-20 12:45:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:07,016 INFO L225 Difference]: With dead ends: 2238 [2022-11-20 12:45:07,016 INFO L226 Difference]: Without dead ends: 1735 [2022-11-20 12:45:07,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:45:07,019 INFO L413 NwaCegarLoop]: 561 mSDtfsCounter, 393 mSDsluCounter, 3338 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 3899 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:07,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 3899 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 12:45:07,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-11-20 12:45:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1005. [2022-11-20 12:45:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 907 states have (on average 1.3296582138919515) internal successors, (1206), 913 states have internal predecessors, (1206), 57 states have call successors, (57), 33 states have call predecessors, (57), 40 states have return successors, (71), 62 states have call predecessors, (71), 55 states have call successors, (71) [2022-11-20 12:45:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1334 transitions. [2022-11-20 12:45:07,146 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1334 transitions. Word has length 73 [2022-11-20 12:45:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:07,153 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1334 transitions. [2022-11-20 12:45:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:45:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1334 transitions. [2022-11-20 12:45:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 12:45:07,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:07,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:07,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:45:07,158 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2060222131, now seen corresponding path program 1 times [2022-11-20 12:45:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:07,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855401438] [2022-11-20 12:45:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:07,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 12:45:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:45:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:07,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855401438] [2022-11-20 12:45:07,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855401438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:07,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:07,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-20 12:45:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776572916] [2022-11-20 12:45:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:07,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 12:45:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:45:07,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:45:07,828 INFO L87 Difference]: Start difference. First operand 1005 states and 1334 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:45:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:10,009 INFO L93 Difference]: Finished difference Result 2252 states and 3040 transitions. [2022-11-20 12:45:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 12:45:10,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 73 [2022-11-20 12:45:10,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:10,018 INFO L225 Difference]: With dead ends: 2252 [2022-11-20 12:45:10,018 INFO L226 Difference]: Without dead ends: 1735 [2022-11-20 12:45:10,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2022-11-20 12:45:10,022 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 1009 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 5606 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:10,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 5606 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 12:45:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-11-20 12:45:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1005. [2022-11-20 12:45:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 907 states have (on average 1.3274531422271223) internal successors, (1204), 913 states have internal predecessors, (1204), 57 states have call successors, (57), 33 states have call predecessors, (57), 40 states have return successors, (71), 62 states have call predecessors, (71), 55 states have call successors, (71) [2022-11-20 12:45:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1332 transitions. [2022-11-20 12:45:10,181 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1332 transitions. Word has length 73 [2022-11-20 12:45:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:10,182 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1332 transitions. [2022-11-20 12:45:10,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 7 states have internal predecessors, (60), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-20 12:45:10,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1332 transitions. [2022-11-20 12:45:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-11-20 12:45:10,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:10,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:10,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:45:10,185 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash 190037653, now seen corresponding path program 1 times [2022-11-20 12:45:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:10,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305911900] [2022-11-20 12:45:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:10,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 12:45:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:10,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305911900] [2022-11-20 12:45:10,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305911900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:10,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:10,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:45:10,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881495299] [2022-11-20 12:45:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:10,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:10,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:10,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:45:10,729 INFO L87 Difference]: Start difference. First operand 1005 states and 1332 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 12:45:12,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:12,152 INFO L93 Difference]: Finished difference Result 1546 states and 2049 transitions. [2022-11-20 12:45:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:45:12,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 76 [2022-11-20 12:45:12,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:12,172 INFO L225 Difference]: With dead ends: 1546 [2022-11-20 12:45:12,172 INFO L226 Difference]: Without dead ends: 1543 [2022-11-20 12:45:12,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:45:12,174 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 992 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:12,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 2154 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 12:45:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-11-20 12:45:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1505. [2022-11-20 12:45:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1359 states have (on average 1.329654157468727) internal successors, (1807), 1369 states have internal predecessors, (1807), 86 states have call successors, (86), 48 states have call predecessors, (86), 59 states have return successors, (111), 94 states have call predecessors, (111), 84 states have call successors, (111) [2022-11-20 12:45:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2004 transitions. [2022-11-20 12:45:12,363 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2004 transitions. Word has length 76 [2022-11-20 12:45:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:12,364 INFO L495 AbstractCegarLoop]: Abstraction has 1505 states and 2004 transitions. [2022-11-20 12:45:12,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 5 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-20 12:45:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2004 transitions. [2022-11-20 12:45:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 12:45:12,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:12,367 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:12,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:45:12,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:12,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1115203550, now seen corresponding path program 1 times [2022-11-20 12:45:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:12,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059548901] [2022-11-20 12:45:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 12:45:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:45:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 12:45:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:13,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:13,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059548901] [2022-11-20 12:45:13,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059548901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:13,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:13,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393665231] [2022-11-20 12:45:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:13,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:13,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:13,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:13,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:13,375 INFO L87 Difference]: Start difference. First operand 1505 states and 2004 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:14,863 INFO L93 Difference]: Finished difference Result 3032 states and 4029 transitions. [2022-11-20 12:45:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:45:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2022-11-20 12:45:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:14,877 INFO L225 Difference]: With dead ends: 3032 [2022-11-20 12:45:14,878 INFO L226 Difference]: Without dead ends: 1548 [2022-11-20 12:45:14,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:45:14,882 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 853 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:14,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1372 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 12:45:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-11-20 12:45:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1503. [2022-11-20 12:45:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1358 states have (on average 1.3276877761413843) internal successors, (1803), 1370 states have internal predecessors, (1803), 83 states have call successors, (83), 48 states have call predecessors, (83), 61 states have return successors, (111), 91 states have call predecessors, (111), 81 states have call successors, (111) [2022-11-20 12:45:15,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1997 transitions. [2022-11-20 12:45:15,107 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1997 transitions. Word has length 93 [2022-11-20 12:45:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:15,108 INFO L495 AbstractCegarLoop]: Abstraction has 1503 states and 1997 transitions. [2022-11-20 12:45:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1997 transitions. [2022-11-20 12:45:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 12:45:15,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:15,111 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:15,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:45:15,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:15,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 299119202, now seen corresponding path program 1 times [2022-11-20 12:45:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:15,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894551900] [2022-11-20 12:45:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-20 12:45:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-20 12:45:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 12:45:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 12:45:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:15,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:15,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894551900] [2022-11-20 12:45:15,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894551900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:15,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:15,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:15,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612708792] [2022-11-20 12:45:15,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:15,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:15,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:15,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:15,661 INFO L87 Difference]: Start difference. First operand 1503 states and 1997 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:17,250 INFO L93 Difference]: Finished difference Result 4551 states and 6043 transitions. [2022-11-20 12:45:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:17,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2022-11-20 12:45:17,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:17,265 INFO L225 Difference]: With dead ends: 4551 [2022-11-20 12:45:17,266 INFO L226 Difference]: Without dead ends: 3057 [2022-11-20 12:45:17,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:17,271 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 818 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:17,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 1887 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2022-11-20 12:45:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2928. [2022-11-20 12:45:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3344671201814058) internal successors, (3531), 2671 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3912 transitions. [2022-11-20 12:45:17,678 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3912 transitions. Word has length 93 [2022-11-20 12:45:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:17,679 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3912 transitions. [2022-11-20 12:45:17,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3912 transitions. [2022-11-20 12:45:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-20 12:45:17,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:17,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:17,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:45:17,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:17,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1102442664, now seen corresponding path program 1 times [2022-11-20 12:45:17,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944833112] [2022-11-20 12:45:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 12:45:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 12:45:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 12:45:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 12:45:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:18,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:18,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944833112] [2022-11-20 12:45:18,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944833112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:18,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:18,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444876147] [2022-11-20 12:45:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:18,239 INFO L87 Difference]: Start difference. First operand 2928 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:20,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:20,006 INFO L93 Difference]: Finished difference Result 5994 states and 7973 transitions. [2022-11-20 12:45:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:20,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2022-11-20 12:45:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:20,023 INFO L225 Difference]: With dead ends: 5994 [2022-11-20 12:45:20,023 INFO L226 Difference]: Without dead ends: 3075 [2022-11-20 12:45:20,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:20,030 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 817 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:20,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1887 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2022-11-20 12:45:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2931. [2022-11-20 12:45:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2649 states have (on average 1.332955832389581) internal successors, (3531), 2674 states have internal predecessors, (3531), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 3912 transitions. [2022-11-20 12:45:20,427 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 3912 transitions. Word has length 94 [2022-11-20 12:45:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:20,428 INFO L495 AbstractCegarLoop]: Abstraction has 2931 states and 3912 transitions. [2022-11-20 12:45:20,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 3912 transitions. [2022-11-20 12:45:20,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-20 12:45:20,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:20,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:20,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:45:20,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:20,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1030544549, now seen corresponding path program 1 times [2022-11-20 12:45:20,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:20,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674780494] [2022-11-20 12:45:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:20,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-11-20 12:45:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-20 12:45:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:45:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:45:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:20,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:20,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674780494] [2022-11-20 12:45:20,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674780494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:20,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:20,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:20,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452499377] [2022-11-20 12:45:20,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:20,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:20,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:20,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:20,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:20,960 INFO L87 Difference]: Start difference. First operand 2931 states and 3912 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:22,630 INFO L93 Difference]: Finished difference Result 5994 states and 7967 transitions. [2022-11-20 12:45:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:22,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 95 [2022-11-20 12:45:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:22,645 INFO L225 Difference]: With dead ends: 5994 [2022-11-20 12:45:22,646 INFO L226 Difference]: Without dead ends: 3072 [2022-11-20 12:45:22,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:22,652 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 811 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:22,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1887 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 12:45:22,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-11-20 12:45:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2925. [2022-11-20 12:45:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2643 states have (on average 1.3325766174801361) internal successors, (3522), 2668 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3903 transitions. [2022-11-20 12:45:22,984 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3903 transitions. Word has length 95 [2022-11-20 12:45:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:22,985 INFO L495 AbstractCegarLoop]: Abstraction has 2925 states and 3903 transitions. [2022-11-20 12:45:22,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3903 transitions. [2022-11-20 12:45:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 12:45:22,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:22,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:22,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:45:22,989 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:22,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1961803849, now seen corresponding path program 1 times [2022-11-20 12:45:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:22,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084773303] [2022-11-20 12:45:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:45:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:45:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-20 12:45:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 12:45:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:23,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:23,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:23,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084773303] [2022-11-20 12:45:23,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084773303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:23,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:23,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:23,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170562752] [2022-11-20 12:45:23,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:23,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:23,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:23,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:23,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:23,571 INFO L87 Difference]: Start difference. First operand 2925 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:25,113 INFO L93 Difference]: Finished difference Result 5988 states and 7955 transitions. [2022-11-20 12:45:25,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:25,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 96 [2022-11-20 12:45:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:25,129 INFO L225 Difference]: With dead ends: 5988 [2022-11-20 12:45:25,129 INFO L226 Difference]: Without dead ends: 3072 [2022-11-20 12:45:25,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:25,138 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 813 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:25,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1887 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-11-20 12:45:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2928. [2022-11-20 12:45:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2646 states have (on average 1.3310657596371882) internal successors, (3522), 2671 states have internal predecessors, (3522), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3903 transitions. [2022-11-20 12:45:25,665 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3903 transitions. Word has length 96 [2022-11-20 12:45:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:25,666 INFO L495 AbstractCegarLoop]: Abstraction has 2928 states and 3903 transitions. [2022-11-20 12:45:25,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3903 transitions. [2022-11-20 12:45:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-20 12:45:25,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:25,671 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:25,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:45:25,672 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:25,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash -400625242, now seen corresponding path program 1 times [2022-11-20 12:45:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:25,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753232] [2022-11-20 12:45:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:45:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 12:45:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:45:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 12:45:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:26,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:26,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753232] [2022-11-20 12:45:26,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:26,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:26,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123601957] [2022-11-20 12:45:26,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:26,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:26,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:26,221 INFO L87 Difference]: Start difference. First operand 2928 states and 3903 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:27,780 INFO L93 Difference]: Finished difference Result 5988 states and 7949 transitions. [2022-11-20 12:45:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 97 [2022-11-20 12:45:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:27,805 INFO L225 Difference]: With dead ends: 5988 [2022-11-20 12:45:27,811 INFO L226 Difference]: Without dead ends: 3069 [2022-11-20 12:45:27,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:27,818 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 807 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:27,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1887 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:27,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2022-11-20 12:45:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2922. [2022-11-20 12:45:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2640 states have (on average 1.330681818181818) internal successors, (3513), 2665 states have internal predecessors, (3513), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3894 transitions. [2022-11-20 12:45:28,181 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3894 transitions. Word has length 97 [2022-11-20 12:45:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:28,182 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3894 transitions. [2022-11-20 12:45:28,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3894 transitions. [2022-11-20 12:45:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-20 12:45:28,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:28,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:28,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:45:28,188 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1958173396, now seen corresponding path program 1 times [2022-11-20 12:45:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:28,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976692718] [2022-11-20 12:45:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:28,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 12:45:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 12:45:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 12:45:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 12:45:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:28,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:28,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976692718] [2022-11-20 12:45:28,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976692718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:28,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:28,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:28,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386108599] [2022-11-20 12:45:28,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:28,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:28,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:28,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:28,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:28,712 INFO L87 Difference]: Start difference. First operand 2922 states and 3894 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:30,298 INFO L93 Difference]: Finished difference Result 5970 states and 7925 transitions. [2022-11-20 12:45:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:30,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 98 [2022-11-20 12:45:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:30,310 INFO L225 Difference]: With dead ends: 5970 [2022-11-20 12:45:30,311 INFO L226 Difference]: Without dead ends: 3057 [2022-11-20 12:45:30,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:30,318 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 800 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:30,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1887 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2022-11-20 12:45:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2919. [2022-11-20 12:45:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2919 states, 2637 states have (on average 1.329920364050057) internal successors, (3507), 2662 states have internal predecessors, (3507), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 3888 transitions. [2022-11-20 12:45:30,695 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 3888 transitions. Word has length 98 [2022-11-20 12:45:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:30,695 INFO L495 AbstractCegarLoop]: Abstraction has 2919 states and 3888 transitions. [2022-11-20 12:45:30,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:30,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 3888 transitions. [2022-11-20 12:45:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-20 12:45:30,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:30,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:30,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:45:30,700 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2000823641, now seen corresponding path program 1 times [2022-11-20 12:45:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:30,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336755713] [2022-11-20 12:45:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-20 12:45:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-20 12:45:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 12:45:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 12:45:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:31,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336755713] [2022-11-20 12:45:31,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336755713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:31,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:31,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317630583] [2022-11-20 12:45:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:31,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:31,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:31,207 INFO L87 Difference]: Start difference. First operand 2919 states and 3888 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:32,796 INFO L93 Difference]: Finished difference Result 5964 states and 7913 transitions. [2022-11-20 12:45:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 99 [2022-11-20 12:45:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:32,812 INFO L225 Difference]: With dead ends: 5964 [2022-11-20 12:45:32,813 INFO L226 Difference]: Without dead ends: 3054 [2022-11-20 12:45:32,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:32,820 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 798 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:32,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1887 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 12:45:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-11-20 12:45:33,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 2916. [2022-11-20 12:45:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2634 states have (on average 1.3291571753986333) internal successors, (3501), 2659 states have internal predecessors, (3501), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3882 transitions. [2022-11-20 12:45:33,321 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3882 transitions. Word has length 99 [2022-11-20 12:45:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:33,322 INFO L495 AbstractCegarLoop]: Abstraction has 2916 states and 3882 transitions. [2022-11-20 12:45:33,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 5 states have internal predecessors, (78), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:33,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3882 transitions. [2022-11-20 12:45:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-20 12:45:33,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:33,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:33,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:45:33,327 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:33,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1968688333, now seen corresponding path program 1 times [2022-11-20 12:45:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:33,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721268275] [2022-11-20 12:45:33,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:33,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 12:45:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 12:45:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 12:45:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 12:45:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:33,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:45:33,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721268275] [2022-11-20 12:45:33,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721268275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:33,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:33,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:45:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071619601] [2022-11-20 12:45:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:33,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:45:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:33,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:45:33,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:45:33,849 INFO L87 Difference]: Start difference. First operand 2916 states and 3882 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:35,321 INFO L93 Difference]: Finished difference Result 5958 states and 7901 transitions. [2022-11-20 12:45:35,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:45:35,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 100 [2022-11-20 12:45:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:35,330 INFO L225 Difference]: With dead ends: 5958 [2022-11-20 12:45:35,331 INFO L226 Difference]: Without dead ends: 3051 [2022-11-20 12:45:35,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:35,336 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 796 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:35,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1887 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 12:45:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-11-20 12:45:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2913. [2022-11-20 12:45:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2913 states, 2631 states have (on average 1.3283922462941846) internal successors, (3495), 2656 states have internal predecessors, (3495), 160 states have call successors, (160), 91 states have call predecessors, (160), 121 states have return successors, (221), 178 states have call predecessors, (221), 158 states have call successors, (221) [2022-11-20 12:45:35,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2913 states to 2913 states and 3876 transitions. [2022-11-20 12:45:35,574 INFO L78 Accepts]: Start accepts. Automaton has 2913 states and 3876 transitions. Word has length 100 [2022-11-20 12:45:35,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:35,574 INFO L495 AbstractCegarLoop]: Abstraction has 2913 states and 3876 transitions. [2022-11-20 12:45:35,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2913 states and 3876 transitions. [2022-11-20 12:45:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-20 12:45:35,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:35,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:35,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:45:35,580 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:35,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1466210216, now seen corresponding path program 1 times [2022-11-20 12:45:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:35,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710824303] [2022-11-20 12:45:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 12:45:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 12:45:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 12:45:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:45:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:45:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:45:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710824303] [2022-11-20 12:45:36,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710824303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460659263] [2022-11-20 12:45:36,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:36,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:45:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:45:36,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:45:36,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:45:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:37,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 2156 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 12:45:37,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:45:37,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:45:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460659263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:37,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:45:37,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-20 12:45:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685663315] [2022-11-20 12:45:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:37,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:45:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:45:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:45:37,677 INFO L87 Difference]: Start difference. First operand 2913 states and 3876 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:45:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:38,134 INFO L93 Difference]: Finished difference Result 5809 states and 7733 transitions. [2022-11-20 12:45:38,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:45:38,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2022-11-20 12:45:38,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:38,143 INFO L225 Difference]: With dead ends: 5809 [2022-11-20 12:45:38,143 INFO L226 Difference]: Without dead ends: 2908 [2022-11-20 12:45:38,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:45:38,150 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:38,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1877 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:45:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-11-20 12:45:38,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2022-11-20 12:45:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2628 states have (on average 1.3280060882800608) internal successors, (3490), 2652 states have internal predecessors, (3490), 159 states have call successors, (159), 90 states have call predecessors, (159), 120 states have return successors, (220), 177 states have call predecessors, (220), 157 states have call successors, (220) [2022-11-20 12:45:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 3869 transitions. [2022-11-20 12:45:38,486 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 3869 transitions. Word has length 101 [2022-11-20 12:45:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:38,486 INFO L495 AbstractCegarLoop]: Abstraction has 2908 states and 3869 transitions. [2022-11-20 12:45:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 5 states have internal predecessors, (78), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 12:45:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 3869 transitions. [2022-11-20 12:45:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-20 12:45:38,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:38,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:38,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:38,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:45:38,702 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1414387121, now seen corresponding path program 1 times [2022-11-20 12:45:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:38,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967285323] [2022-11-20 12:45:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:45:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:45:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:45:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:45:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 12:45:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:45:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:39,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967285323] [2022-11-20 12:45:39,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967285323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:45:39,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238977460] [2022-11-20 12:45:39,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:39,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:45:39,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:45:39,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:45:39,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:45:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:40,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 12:45:40,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:45:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:45:40,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:45:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 12:45:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238977460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:45:41,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:45:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-11-20 12:45:41,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990538098] [2022-11-20 12:45:41,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:45:41,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 12:45:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:45:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:45:41,142 INFO L87 Difference]: Start difference. First operand 2908 states and 3869 transitions. Second operand has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 12:45:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:44,986 INFO L93 Difference]: Finished difference Result 6365 states and 8552 transitions. [2022-11-20 12:45:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:45:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) Word has length 103 [2022-11-20 12:45:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:44,999 INFO L225 Difference]: With dead ends: 6365 [2022-11-20 12:45:45,000 INFO L226 Difference]: Without dead ends: 3473 [2022-11-20 12:45:45,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2022-11-20 12:45:45,007 INFO L413 NwaCegarLoop]: 665 mSDtfsCounter, 2078 mSDsluCounter, 11038 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 11703 SdHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:45,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 11703 Invalid, 2646 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [216 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-20 12:45:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3473 states. [2022-11-20 12:45:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3473 to 2033. [2022-11-20 12:45:45,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2033 states, 1822 states have (on average 1.3117453347969266) internal successors, (2390), 1837 states have internal predecessors, (2390), 121 states have call successors, (121), 76 states have call predecessors, (121), 89 states have return successors, (153), 127 states have call predecessors, (153), 119 states have call successors, (153) [2022-11-20 12:45:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2033 states to 2033 states and 2664 transitions. [2022-11-20 12:45:45,385 INFO L78 Accepts]: Start accepts. Automaton has 2033 states and 2664 transitions. Word has length 103 [2022-11-20 12:45:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:45,386 INFO L495 AbstractCegarLoop]: Abstraction has 2033 states and 2664 transitions. [2022-11-20 12:45:45,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.782608695652174) internal successors, (110), 16 states have internal predecessors, (110), 5 states have call successors, (18), 5 states have call predecessors, (18), 7 states have return successors, (15), 8 states have call predecessors, (15), 5 states have call successors, (15) [2022-11-20 12:45:45,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2033 states and 2664 transitions. [2022-11-20 12:45:45,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 12:45:45,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:45:45,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:45:45,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:45:45,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:45:45,603 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 12:45:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:45:45,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1722415670, now seen corresponding path program 1 times [2022-11-20 12:45:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:45:45,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101467137] [2022-11-20 12:45:45,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:45:45,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:45:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 12:45:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 12:45:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:45:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 12:45:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 12:45:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:45:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 12:45:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 12:45:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:45:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:45:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-20 12:45:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:45:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101467137] [2022-11-20 12:45:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101467137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:45:46,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:45:46,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:45:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112258061] [2022-11-20 12:45:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:45:46,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:45:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:45:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:45:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:45:46,365 INFO L87 Difference]: Start difference. First operand 2033 states and 2664 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:45:47,399 INFO L93 Difference]: Finished difference Result 2165 states and 2792 transitions. [2022-11-20 12:45:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:45:47,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 105 [2022-11-20 12:45:47,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:45:47,401 INFO L225 Difference]: With dead ends: 2165 [2022-11-20 12:45:47,401 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:45:47,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 12:45:47,406 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 608 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:45:47,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1554 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 12:45:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:45:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:45:47,407 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-20 12:45:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:45:47,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-11-20 12:45:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:45:47,408 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:45:47,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 7 states have internal predecessors, (82), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-20 12:45:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:45:47,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:45:47,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 12:45:47,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:45:47,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:46:05,459 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:46:24,811 WARN L233 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:46:30,843 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:46:37,642 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:46:42,874 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:46:49,898 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:46:55,306 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:03,283 WARN L233 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:09,100 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:15,673 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:21,436 WARN L233 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:27,353 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:34,479 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:41,691 WARN L233 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:46,914 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:47:53,715 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:48:01,781 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:48:25,052 WARN L233 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 79 DAG size of output: 67 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:48:46,384 INFO L895 garLoopResultBuilder]: At program point L4090(lines 4089 4124) the Hoare annotation is: (or (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= 1 |ir_xbof_change_#in~xbof___0|) (<= (+ |ir_xbof_change_#in~xbof___0| 255) 0))) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2022-11-20 12:48:46,384 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4086 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,384 INFO L899 garLoopResultBuilder]: For program point ir_xbof_changeEXIT(lines 4065 4127) no Hoare annotation was computed. [2022-11-20 12:48:46,385 INFO L899 garLoopResultBuilder]: For program point L4074(lines 4074 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,385 INFO L895 garLoopResultBuilder]: At program point L4095(lines 4094 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2022-11-20 12:48:46,385 INFO L895 garLoopResultBuilder]: At program point L4087(lines 4086 4124) the Hoare annotation is: (or (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= (+ |ir_xbof_change_#in~xbof___0| 254) 0) (<= 2 |ir_xbof_change_#in~xbof___0|))) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2022-11-20 12:48:46,385 INFO L899 garLoopResultBuilder]: For program point L4083(lines 4083 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,385 INFO L895 garLoopResultBuilder]: At program point L4075(lines 4071 4124) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (not (= ~ldv_urb_state~0 0)))) (and (or .cse0 .cse1 (<= 24 |ir_xbof_change_#in~xbof___0|) (<= (+ 228 |ir_xbof_change_#in~xbof___0|) 0) (not (= ~ir_add_bof~0 0))) (or .cse0 .cse1 (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)))) [2022-11-20 12:48:46,385 INFO L899 garLoopResultBuilder]: For program point L4071(lines 4071 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,386 INFO L899 garLoopResultBuilder]: For program point L4092(lines 4092 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,386 INFO L895 garLoopResultBuilder]: At program point L4084(lines 4083 4124) the Hoare annotation is: (or (and (or (<= (+ |ir_xbof_change_#in~xbof___0| 253) 0) (<= 3 |ir_xbof_change_#in~xbof___0|)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0))) [2022-11-20 12:48:46,386 INFO L899 garLoopResultBuilder]: For program point L4080(lines 4080 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,386 INFO L899 garLoopResultBuilder]: For program point ir_xbof_changeFINAL(lines 4065 4127) no Hoare annotation was computed. [2022-11-20 12:48:46,386 INFO L899 garLoopResultBuilder]: For program point L4068(lines 4068 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,386 INFO L895 garLoopResultBuilder]: At program point L4093(lines 4092 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2022-11-20 12:48:46,387 INFO L895 garLoopResultBuilder]: At program point L4122(lines 4096 4123) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) [2022-11-20 12:48:46,387 INFO L902 garLoopResultBuilder]: At program point ir_xbof_changeENTRY(lines 4065 4127) the Hoare annotation is: true [2022-11-20 12:48:46,387 INFO L899 garLoopResultBuilder]: For program point L4089(lines 4089 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,387 INFO L895 garLoopResultBuilder]: At program point L4081(lines 4077 4124) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (not (= ~ldv_urb_state~0 0)))) (and (or .cse0 .cse1 (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0)) (or .cse0 .cse1 (<= 5 |ir_xbof_change_#in~xbof___0|) (not (= ~ir_add_bof~0 0)) (<= (+ |ir_xbof_change_#in~xbof___0| 250) 0)))) [2022-11-20 12:48:46,387 INFO L899 garLoopResultBuilder]: For program point L4077(lines 4077 4124) no Hoare annotation was computed. [2022-11-20 12:48:46,387 INFO L895 garLoopResultBuilder]: At program point L4069(lines 4068 4124) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (and (= |ir_xbof_change_#in~xbof___0| ir_xbof_change_~xbof___0) (or (<= 48 |ir_xbof_change_#in~xbof___0|) (<= (+ |ir_xbof_change_#in~xbof___0| 208) 0))) (not (= ~ldv_urb_state~0 0))) [2022-11-20 12:48:46,389 INFO L895 garLoopResultBuilder]: At program point L5147(lines 5146 5148) the Hoare annotation is: (let ((.cse0 (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (or (not (<= .cse0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (<= 0 .cse0)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)))) [2022-11-20 12:48:46,389 INFO L895 garLoopResultBuilder]: At program point ir_initENTRY(lines 4614 4647) the Hoare annotation is: (let ((.cse0 (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (or (not (<= .cse0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (<= 0 .cse0)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)))) [2022-11-20 12:48:46,389 INFO L899 garLoopResultBuilder]: For program point ir_initFINAL(lines 4614 4647) no Hoare annotation was computed. [2022-11-20 12:48:46,389 INFO L895 garLoopResultBuilder]: At program point L4633(lines 4616 4646) the Hoare annotation is: (let ((.cse0 (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (and (= |#memory_int| |old(#memory_int)|) (not (= |ir_init_~retval~0#1| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2022-11-20 12:48:46,390 INFO L899 garLoopResultBuilder]: For program point L4625(lines 4625 4628) no Hoare annotation was computed. [2022-11-20 12:48:46,390 INFO L899 garLoopResultBuilder]: For program point L4617-2(lines 4617 4621) no Hoare annotation was computed. [2022-11-20 12:48:46,390 INFO L899 garLoopResultBuilder]: For program point L4617(lines 4617 4621) no Hoare annotation was computed. [2022-11-20 12:48:46,390 INFO L895 garLoopResultBuilder]: At program point L4642(lines 4616 4646) the Hoare annotation is: (let ((.cse0 (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)) (and (= |#memory_int| |old(#memory_int)|) (not (= |ir_init_~retval~0#1| 0)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2022-11-20 12:48:46,390 INFO L899 garLoopResultBuilder]: For program point ir_initEXIT(lines 4614 4647) no Hoare annotation was computed. [2022-11-20 12:48:46,391 INFO L899 garLoopResultBuilder]: For program point L4632(lines 4632 4635) no Hoare annotation was computed. [2022-11-20 12:48:46,391 INFO L895 garLoopResultBuilder]: At program point L5136(lines 5135 5137) the Hoare annotation is: (let ((.cse0 (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (or (not (<= .cse0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (<= 0 .cse0)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)))) [2022-11-20 12:48:46,391 INFO L895 garLoopResultBuilder]: At program point L3695(lines 3689 3697) the Hoare annotation is: (let ((.cse0 (+ (select (select |old(#memory_int)| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (or (not (<= .cse0 0)) (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (<= 0 .cse0)) (not (= (select (select |old(#memory_int)| |~#debug~0.base|) |~#debug~0.offset|) 0)) (not (= ~ldv_coherent_state~0 0)) (not (= (select (select |old(#memory_int)| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0)) (not (= ~ldv_urb_state~0 0)) (not (= ~ir_add_bof~0 0)))) [2022-11-20 12:48:46,391 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 5154 5156) no Hoare annotation was computed. [2022-11-20 12:48:46,392 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 5154 5156) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (= |old(#valid)| |#valid|))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-11-20 12:48:46,392 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 5154 5156) no Hoare annotation was computed. [2022-11-20 12:48:46,392 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 5097 5099) no Hoare annotation was computed. [2022-11-20 12:48:46,392 INFO L899 garLoopResultBuilder]: For program point L5098(line 5098) no Hoare annotation was computed. [2022-11-20 12:48:46,392 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 5097 5099) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-20 12:48:46,392 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 5097 5099) no Hoare annotation was computed. [2022-11-20 12:48:46,393 INFO L899 garLoopResultBuilder]: For program point __kfifo_uint_must_check_helperEXIT(lines 3729 3734) no Hoare annotation was computed. [2022-11-20 12:48:46,393 INFO L902 garLoopResultBuilder]: At program point __kfifo_uint_must_check_helperENTRY(lines 3729 3734) the Hoare annotation is: true [2022-11-20 12:48:46,393 INFO L899 garLoopResultBuilder]: For program point __kfifo_uint_must_check_helperFINAL(lines 3729 3734) no Hoare annotation was computed. [2022-11-20 12:48:46,393 INFO L899 garLoopResultBuilder]: For program point L5019(lines 5017 5036) no Hoare annotation was computed. [2022-11-20 12:48:46,393 INFO L902 garLoopResultBuilder]: At program point L5021(line 5021) the Hoare annotation is: true [2022-11-20 12:48:46,393 INFO L895 garLoopResultBuilder]: At program point L5017loopEntry(lines 5017 5036) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= |usb_free_urb_#in~urb.base| usb_free_urb_~urb.base))) [2022-11-20 12:48:46,394 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 5013 5042) no Hoare annotation was computed. [2022-11-20 12:48:46,398 INFO L899 garLoopResultBuilder]: For program point L5026(lines 5026 5031) no Hoare annotation was computed. [2022-11-20 12:48:46,399 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 5013 5042) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2022-11-20 12:48:46,400 INFO L899 garLoopResultBuilder]: For program point L5018(lines 5017 5036) no Hoare annotation was computed. [2022-11-20 12:48:46,400 INFO L895 garLoopResultBuilder]: At program point L5037(lines 5013 5042) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (and (= ~ldv_urb_state~0 0) (= |usb_free_urb_#in~urb.base| usb_free_urb_~urb.base) (let ((.cse0 (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* .cse1 18446744073709551616))) (<= (+ .cse1 1) 0))))) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2022-11-20 12:48:46,401 INFO L895 garLoopResultBuilder]: At program point L5029(line 5029) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (= ~ldv_coherent_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2022-11-20 12:48:46,401 INFO L899 garLoopResultBuilder]: For program point L5029-1(lines 5026 5031) no Hoare annotation was computed. [2022-11-20 12:48:46,401 INFO L902 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 3723 3728) the Hoare annotation is: true [2022-11-20 12:48:46,401 INFO L899 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 3723 3728) no Hoare annotation was computed. [2022-11-20 12:48:46,401 INFO L899 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 3723 3728) no Hoare annotation was computed. [2022-11-20 12:48:46,402 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 5072 5076) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-11-20 12:48:46,402 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 5072 5076) no Hoare annotation was computed. [2022-11-20 12:48:46,402 INFO L899 garLoopResultBuilder]: For program point L5074(line 5074) no Hoare annotation was computed. [2022-11-20 12:48:46,402 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 5072 5076) no Hoare annotation was computed. [2022-11-20 12:48:46,402 INFO L902 garLoopResultBuilder]: At program point L4655(line 4655) the Hoare annotation is: true [2022-11-20 12:48:46,403 INFO L899 garLoopResultBuilder]: For program point ir_exitFINAL(lines 4650 4659) no Hoare annotation was computed. [2022-11-20 12:48:46,403 INFO L902 garLoopResultBuilder]: At program point L5132(lines 5131 5133) the Hoare annotation is: true [2022-11-20 12:48:46,403 INFO L902 garLoopResultBuilder]: At program point ir_exitENTRY(lines 4650 4659) the Hoare annotation is: true [2022-11-20 12:48:46,403 INFO L899 garLoopResultBuilder]: For program point ir_exitEXIT(lines 4650 4659) no Hoare annotation was computed. [2022-11-20 12:48:46,403 INFO L899 garLoopResultBuilder]: For program point usb_serial_deregisterEXIT(lines 5138 5140) no Hoare annotation was computed. [2022-11-20 12:48:46,404 INFO L902 garLoopResultBuilder]: At program point usb_serial_deregisterENTRY(lines 5138 5140) the Hoare annotation is: true [2022-11-20 12:48:46,404 INFO L899 garLoopResultBuilder]: For program point usb_serial_deregisterFINAL(lines 5138 5140) no Hoare annotation was computed. [2022-11-20 12:48:46,404 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4918 4924) the Hoare annotation is: true [2022-11-20 12:48:46,404 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4918 4924) no Hoare annotation was computed. [2022-11-20 12:48:46,405 INFO L895 garLoopResultBuilder]: At program point kmallocENTRY(lines 3644 3653) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-11-20 12:48:46,405 INFO L899 garLoopResultBuilder]: For program point kmallocFINAL(lines 3644 3653) no Hoare annotation was computed. [2022-11-20 12:48:46,405 INFO L895 garLoopResultBuilder]: At program point L5078(line 5078) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_coherent_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)))) (and (or .cse0 (not (= ~ldv_urb_state~0 0)) .cse1) (or (not (<= 1 ~ldv_urb_state~0)) .cse0 .cse1 (not (<= ~ldv_urb_state~0 1))))) [2022-11-20 12:48:46,405 INFO L899 garLoopResultBuilder]: For program point kmallocEXIT(lines 3644 3653) no Hoare annotation was computed. [2022-11-20 12:48:46,405 INFO L899 garLoopResultBuilder]: For program point L5078-1(line 5078) no Hoare annotation was computed. [2022-11-20 12:48:46,406 INFO L902 garLoopResultBuilder]: At program point L5078-2(lines 5077 5079) the Hoare annotation is: true [2022-11-20 12:48:46,406 INFO L902 garLoopResultBuilder]: At program point L5056-1(lines 5044 5061) the Hoare annotation is: true [2022-11-20 12:48:46,406 INFO L899 garLoopResultBuilder]: For program point L5122-1(line 5122) no Hoare annotation was computed. [2022-11-20 12:48:46,406 INFO L899 garLoopResultBuilder]: For program point L3999(lines 3999 4005) no Hoare annotation was computed. [2022-11-20 12:48:46,406 INFO L895 garLoopResultBuilder]: At program point L5122-2(lines 5121 5123) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,407 INFO L895 garLoopResultBuilder]: At program point L5056(line 5056) the Hoare annotation is: false [2022-11-20 12:48:46,407 INFO L895 garLoopResultBuilder]: At program point L4891(lines 4823 4894) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,407 INFO L895 garLoopResultBuilder]: At program point L3636(lines 3625 3641) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,407 INFO L895 garLoopResultBuilder]: At program point L4594(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,407 INFO L899 garLoopResultBuilder]: For program point L4495(lines 4495 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,408 INFO L895 garLoopResultBuilder]: At program point L4264(lines 4234 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,408 INFO L899 garLoopResultBuilder]: For program point L3868(line 3868) no Hoare annotation was computed. [2022-11-20 12:48:46,408 INFO L895 garLoopResultBuilder]: At program point L4496(lines 4495 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,408 INFO L899 garLoopResultBuilder]: For program point L4232(lines 4232 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,409 INFO L895 garLoopResultBuilder]: At program point L3968(lines 3818 3973) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,409 INFO L895 garLoopResultBuilder]: At program point L4992loopEntry(lines 4992 5005) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,409 INFO L899 garLoopResultBuilder]: For program point L3869(lines 3869 3875) no Hoare annotation was computed. [2022-11-20 12:48:46,409 INFO L899 garLoopResultBuilder]: For program point L4860(lines 4860 4863) no Hoare annotation was computed. [2022-11-20 12:48:46,409 INFO L899 garLoopResultBuilder]: For program point L4563(lines 4563 4569) no Hoare annotation was computed. [2022-11-20 12:48:46,409 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,410 INFO L895 garLoopResultBuilder]: At program point L5125(lines 5124 5126) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,410 INFO L895 garLoopResultBuilder]: At program point L5092(lines 5091 5093) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,410 INFO L899 garLoopResultBuilder]: For program point L4035(lines 4035 4053) no Hoare annotation was computed. [2022-11-20 12:48:46,410 INFO L895 garLoopResultBuilder]: At program point L4993(line 4993) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,411 INFO L899 garLoopResultBuilder]: For program point L4828(lines 4828 4833) no Hoare annotation was computed. [2022-11-20 12:48:46,411 INFO L899 garLoopResultBuilder]: For program point L4498(lines 4498 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,411 INFO L895 garLoopResultBuilder]: At program point L4333loopEntry(lines 4333 4348) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,411 INFO L895 garLoopResultBuilder]: At program point L4895(lines 4822 4896) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,411 INFO L899 garLoopResultBuilder]: For program point L3838(line 3838) no Hoare annotation was computed. [2022-11-20 12:48:46,412 INFO L895 garLoopResultBuilder]: At program point L4598(line 4598) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,412 INFO L895 garLoopResultBuilder]: At program point L4499(lines 4498 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,412 INFO L895 garLoopResultBuilder]: At program point L4334(lines 4333 4348) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,412 INFO L899 garLoopResultBuilder]: For program point L4268(line 4268) no Hoare annotation was computed. [2022-11-20 12:48:46,413 INFO L899 garLoopResultBuilder]: For program point L4169(lines 4169 4173) no Hoare annotation was computed. [2022-11-20 12:48:46,413 INFO L899 garLoopResultBuilder]: For program point L4169-2(lines 4169 4173) no Hoare annotation was computed. [2022-11-20 12:48:46,413 INFO L899 garLoopResultBuilder]: For program point L4995(line 4995) no Hoare annotation was computed. [2022-11-20 12:48:46,413 INFO L895 garLoopResultBuilder]: At program point L4037loopEntry(lines 4037 4047) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,413 INFO L895 garLoopResultBuilder]: At program point L3938(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,414 INFO L899 garLoopResultBuilder]: For program point L4830(lines 4830 4833) no Hoare annotation was computed. [2022-11-20 12:48:46,414 INFO L899 garLoopResultBuilder]: For program point L3839(lines 3839 3845) no Hoare annotation was computed. [2022-11-20 12:48:46,414 INFO L899 garLoopResultBuilder]: For program point L4830-1(lines 4828 4833) no Hoare annotation was computed. [2022-11-20 12:48:46,414 INFO L899 garLoopResultBuilder]: For program point L4401(lines 4401 4404) no Hoare annotation was computed. [2022-11-20 12:48:46,414 INFO L895 garLoopResultBuilder]: At program point L5095(lines 5094 5096) the Hoare annotation is: (let ((.cse0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (<= .cse0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (<= 0 .cse0))) [2022-11-20 12:48:46,415 INFO L899 garLoopResultBuilder]: For program point L4038(line 4038) no Hoare annotation was computed. [2022-11-20 12:48:46,415 INFO L899 garLoopResultBuilder]: For program point L4501(lines 4501 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,415 INFO L895 garLoopResultBuilder]: At program point L4303(lines 4293 4304) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,415 INFO L895 garLoopResultBuilder]: At program point L4270(lines 4128 4272) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,415 INFO L899 garLoopResultBuilder]: For program point L4369(line 4369) no Hoare annotation was computed. [2022-11-20 12:48:46,416 INFO L895 garLoopResultBuilder]: At program point L5129(lines 5128 5130) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,416 INFO L899 garLoopResultBuilder]: For program point L4039(lines 4039 4045) no Hoare annotation was computed. [2022-11-20 12:48:46,416 INFO L895 garLoopResultBuilder]: At program point L4502(lines 4501 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,416 INFO L895 garLoopResultBuilder]: At program point L4469loopEntry(lines 4469 4479) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,416 INFO L899 garLoopResultBuilder]: For program point L4337(line 4337) no Hoare annotation was computed. [2022-11-20 12:48:46,416 INFO L899 garLoopResultBuilder]: For program point L4998(lines 4998 5001) no Hoare annotation was computed. [2022-11-20 12:48:46,417 INFO L895 garLoopResultBuilder]: At program point L5064(lines 5063 5065) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,417 INFO L895 garLoopResultBuilder]: At program point L3908(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,417 INFO L899 garLoopResultBuilder]: For program point L4470(line 4470) no Hoare annotation was computed. [2022-11-20 12:48:46,417 INFO L895 garLoopResultBuilder]: At program point L4008(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,417 INFO L895 garLoopResultBuilder]: At program point L4900(lines 4811 4907) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,418 INFO L895 garLoopResultBuilder]: At program point L3711(lines 3699 3713) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,418 INFO L895 garLoopResultBuilder]: At program point L4603(lines 4467 4610) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,418 INFO L899 garLoopResultBuilder]: For program point L4471(lines 4471 4477) no Hoare annotation was computed. [2022-11-20 12:48:46,418 INFO L899 garLoopResultBuilder]: For program point L4504(lines 4504 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,419 INFO L899 garLoopResultBuilder]: For program point L4372-1(line 4372) no Hoare annotation was computed. [2022-11-20 12:48:46,419 INFO L895 garLoopResultBuilder]: At program point L4372(line 4372) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,419 INFO L899 garLoopResultBuilder]: For program point L4174(lines 4174 4178) no Hoare annotation was computed. [2022-11-20 12:48:46,419 INFO L899 garLoopResultBuilder]: For program point L4174-2(lines 4174 4178) no Hoare annotation was computed. [2022-11-20 12:48:46,419 INFO L899 garLoopResultBuilder]: For program point L3943(line 3943) no Hoare annotation was computed. [2022-11-20 12:48:46,420 INFO L895 garLoopResultBuilder]: At program point L4571(line 4571) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,420 INFO L899 garLoopResultBuilder]: For program point L4571-1(line 4571) no Hoare annotation was computed. [2022-11-20 12:48:46,420 INFO L895 garLoopResultBuilder]: At program point L4505(lines 4504 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,420 INFO L895 garLoopResultBuilder]: At program point L4208(lines 4150 4209) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,420 INFO L899 garLoopResultBuilder]: For program point L3944(lines 3944 3950) no Hoare annotation was computed. [2022-11-20 12:48:46,421 INFO L895 garLoopResultBuilder]: At program point L3878(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,421 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4143 4149) no Hoare annotation was computed. [2022-11-20 12:48:46,421 INFO L895 garLoopResultBuilder]: At program point L5068(lines 5067 5069) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,421 INFO L899 garLoopResultBuilder]: For program point L4837(lines 4837 4893) no Hoare annotation was computed. [2022-11-20 12:48:46,421 INFO L899 garLoopResultBuilder]: For program point L4507(lines 4507 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,421 INFO L895 garLoopResultBuilder]: At program point L4309(lines 4273 4311) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,422 INFO L895 garLoopResultBuilder]: At program point L4838(lines 4837 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,422 INFO L899 garLoopResultBuilder]: For program point L3913(line 3913) no Hoare annotation was computed. [2022-11-20 12:48:46,422 INFO L895 garLoopResultBuilder]: At program point L4607(lines 4458 4611) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,422 INFO L899 garLoopResultBuilder]: For program point L4574(lines 4574 4580) no Hoare annotation was computed. [2022-11-20 12:48:46,422 INFO L895 garLoopResultBuilder]: At program point L4508(lines 4507 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,423 INFO L895 garLoopResultBuilder]: At program point L4376(lines 4312 4378) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,423 INFO L899 garLoopResultBuilder]: For program point L4211(lines 4211 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,423 INFO L895 garLoopResultBuilder]: At program point L4013loopEntry(lines 4013 4028) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,423 INFO L899 garLoopResultBuilder]: For program point L3914(lines 3914 3920) no Hoare annotation was computed. [2022-11-20 12:48:46,423 INFO L895 garLoopResultBuilder]: At program point L3848(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,424 INFO L895 garLoopResultBuilder]: At program point L4410(lines 4379 4412) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,424 INFO L895 garLoopResultBuilder]: At program point L4278loopEntry(lines 4278 4288) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,424 INFO L899 garLoopResultBuilder]: For program point L4179(lines 4179 4183) no Hoare annotation was computed. [2022-11-20 12:48:46,424 INFO L895 garLoopResultBuilder]: At program point L4212(lines 4211 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,424 INFO L899 garLoopResultBuilder]: For program point L4179-2(lines 4179 4183) no Hoare annotation was computed. [2022-11-20 12:48:46,425 INFO L899 garLoopResultBuilder]: For program point L4014(line 4014) no Hoare annotation was computed. [2022-11-20 12:48:46,425 INFO L902 garLoopResultBuilder]: At program point L4906(lines 4799 4908) the Hoare annotation is: true [2022-11-20 12:48:46,425 INFO L899 garLoopResultBuilder]: For program point L4840(lines 4840 4893) no Hoare annotation was computed. [2022-11-20 12:48:46,425 INFO L899 garLoopResultBuilder]: For program point L4510(lines 4510 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,425 INFO L899 garLoopResultBuilder]: For program point L4279(line 4279) no Hoare annotation was computed. [2022-11-20 12:48:46,426 INFO L895 garLoopResultBuilder]: At program point L4048(lines 3981 4063) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,426 INFO L899 garLoopResultBuilder]: For program point L5006(lines 4991 5007) no Hoare annotation was computed. [2022-11-20 12:48:46,426 INFO L895 garLoopResultBuilder]: At program point L5105(lines 5104 5106) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,426 INFO L899 garLoopResultBuilder]: For program point L4015(lines 4015 4026) no Hoare annotation was computed. [2022-11-20 12:48:46,426 INFO L899 garLoopResultBuilder]: For program point L3883(line 3883) no Hoare annotation was computed. [2022-11-20 12:48:46,426 INFO L895 garLoopResultBuilder]: At program point L4841(lines 4840 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,427 INFO L895 garLoopResultBuilder]: At program point L3685(lines 3678 3687) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,427 INFO L895 garLoopResultBuilder]: At program point L4511(lines 4510 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,427 INFO L899 garLoopResultBuilder]: For program point L4214(lines 4214 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,427 INFO L899 garLoopResultBuilder]: For program point L4280(lines 4280 4286) no Hoare annotation was computed. [2022-11-20 12:48:46,427 INFO L899 garLoopResultBuilder]: For program point L4016(lines 4016 4020) no Hoare annotation was computed. [2022-11-20 12:48:46,428 INFO L899 garLoopResultBuilder]: For program point L4016-2(lines 4016 4020) no Hoare annotation was computed. [2022-11-20 12:48:46,428 INFO L899 garLoopResultBuilder]: For program point L3884(lines 3884 3890) no Hoare annotation was computed. [2022-11-20 12:48:46,428 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:48:46,428 INFO L895 garLoopResultBuilder]: At program point L4215(lines 4214 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,428 INFO L899 garLoopResultBuilder]: For program point L4843(lines 4843 4893) no Hoare annotation was computed. [2022-11-20 12:48:46,428 INFO L895 garLoopResultBuilder]: At program point L4546(lines 4514 4547) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,429 INFO L895 garLoopResultBuilder]: At program point L4513(lines 4512 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,429 INFO L895 garLoopResultBuilder]: At program point L4480(lines 4468 4481) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,429 INFO L895 garLoopResultBuilder]: At program point L5108(lines 5107 5109) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,429 INFO L895 garLoopResultBuilder]: At program point L5009(lines 4987 5011) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse4 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|))) (or (and .cse0 (<= 1 ~ldv_urb_state~0) .cse1 (not .cse2) (<= ~ldv_urb_state~0 1) (not .cse3) .cse4) (and .cse0 .cse2 .cse1 .cse3 (= ~ldv_urb_state~0 0) .cse4))) [2022-11-20 12:48:46,430 INFO L899 garLoopResultBuilder]: For program point L3853(line 3853) no Hoare annotation was computed. [2022-11-20 12:48:46,430 INFO L895 garLoopResultBuilder]: At program point L4844(lines 4843 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,430 INFO L895 garLoopResultBuilder]: At program point L3622(lines 3619 3624) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,430 INFO L895 garLoopResultBuilder]: At program point L4349(lines 4332 4350) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,430 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4188) no Hoare annotation was computed. [2022-11-20 12:48:46,430 INFO L899 garLoopResultBuilder]: For program point L4184-2(lines 4184 4188) no Hoare annotation was computed. [2022-11-20 12:48:46,431 INFO L899 garLoopResultBuilder]: For program point L4217(lines 4217 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,431 INFO L895 garLoopResultBuilder]: At program point L4151loopEntry(lines 4151 4207) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,431 INFO L899 garLoopResultBuilder]: For program point L3986(lines 3986 3989) no Hoare annotation was computed. [2022-11-20 12:48:46,431 INFO L895 garLoopResultBuilder]: At program point L3953(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,431 INFO L899 garLoopResultBuilder]: For program point L3854(lines 3854 3860) no Hoare annotation was computed. [2022-11-20 12:48:46,432 INFO L895 garLoopResultBuilder]: At program point L4218(lines 4217 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,432 INFO L895 garLoopResultBuilder]: At program point L5143(lines 5142 5144) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,432 INFO L899 garLoopResultBuilder]: For program point L4152(line 4152) no Hoare annotation was computed. [2022-11-20 12:48:46,432 INFO L899 garLoopResultBuilder]: For program point L4846(lines 4846 4893) no Hoare annotation was computed. [2022-11-20 12:48:46,432 INFO L895 garLoopResultBuilder]: At program point L3822loopEntry(lines 3822 3832) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,433 INFO L899 garLoopResultBuilder]: For program point L4549-2(lines 4549 4557) no Hoare annotation was computed. [2022-11-20 12:48:46,433 INFO L899 garLoopResultBuilder]: For program point L4549(lines 4549 4557) no Hoare annotation was computed. [2022-11-20 12:48:46,433 INFO L899 garLoopResultBuilder]: For program point L4153(lines 4153 4205) no Hoare annotation was computed. [2022-11-20 12:48:46,433 INFO L895 garLoopResultBuilder]: At program point L4847(lines 4846 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,433 INFO L899 garLoopResultBuilder]: For program point L3823(line 3823) no Hoare annotation was computed. [2022-11-20 12:48:46,434 INFO L895 garLoopResultBuilder]: At program point L4583(line 4583) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,434 INFO L899 garLoopResultBuilder]: For program point L4583-1(line 4583) no Hoare annotation was computed. [2022-11-20 12:48:46,434 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:48:46,434 INFO L899 garLoopResultBuilder]: For program point L4154(lines 4154 4158) no Hoare annotation was computed. [2022-11-20 12:48:46,434 INFO L899 garLoopResultBuilder]: For program point L4220(lines 4220 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,435 INFO L899 garLoopResultBuilder]: For program point L4154-2(lines 4154 4158) no Hoare annotation was computed. [2022-11-20 12:48:46,435 INFO L895 garLoopResultBuilder]: At program point L5112(lines 5111 5113) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,435 INFO L895 garLoopResultBuilder]: At program point L3923(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,435 INFO L895 garLoopResultBuilder]: At program point L4815(line 4815) the Hoare annotation is: (let ((.cse0 (+ (select (select |#memory_int| |~#xbof~0.base|) |~#xbof~0.offset|) 1))) (and (= ~ldv_coherent_state~0 0) (= (select (select |#memory_int| |~#buffer_size~0.base|) |~#buffer_size~0.offset|) 0) (= ~ir_add_bof~0 0) (<= .cse0 0) (= ~ldv_urb_state~0 0) (= (select (select |#memory_int| |~#debug~0.base|) |~#debug~0.offset|) 0) (<= 0 .cse0))) [2022-11-20 12:48:46,435 INFO L899 garLoopResultBuilder]: For program point L3824(lines 3824 3830) no Hoare annotation was computed. [2022-11-20 12:48:46,436 INFO L899 garLoopResultBuilder]: For program point L4815-1(line 4815) no Hoare annotation was computed. [2022-11-20 12:48:46,436 INFO L899 garLoopResultBuilder]: For program point L3659-1(line 3659) no Hoare annotation was computed. [2022-11-20 12:48:46,436 INFO L895 garLoopResultBuilder]: At program point L3659(line 3659) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,436 INFO L895 garLoopResultBuilder]: At program point L4551(line 4551) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,436 INFO L899 garLoopResultBuilder]: For program point L4551-1(line 4551) no Hoare annotation was computed. [2022-11-20 12:48:46,437 INFO L899 garLoopResultBuilder]: For program point L4386(lines 4386 4389) no Hoare annotation was computed. [2022-11-20 12:48:46,437 INFO L895 garLoopResultBuilder]: At program point L4221(lines 4220 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,437 INFO L899 garLoopResultBuilder]: For program point L5047(lines 5047 5052) no Hoare annotation was computed. [2022-11-20 12:48:46,437 INFO L899 garLoopResultBuilder]: For program point L4849(lines 4849 4893) no Hoare annotation was computed. [2022-11-20 12:48:46,437 INFO L899 garLoopResultBuilder]: For program point L4486(lines 4486 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,438 INFO L899 garLoopResultBuilder]: For program point L4189(lines 4189 4193) no Hoare annotation was computed. [2022-11-20 12:48:46,438 INFO L899 garLoopResultBuilder]: For program point L4189-2(lines 4189 4193) no Hoare annotation was computed. [2022-11-20 12:48:46,438 INFO L899 garLoopResultBuilder]: For program point L3991-1(line 3991) no Hoare annotation was computed. [2022-11-20 12:48:46,438 INFO L899 garLoopResultBuilder]: For program point L3958(line 3958) no Hoare annotation was computed. [2022-11-20 12:48:46,438 INFO L895 garLoopResultBuilder]: At program point L3991(line 3991) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,439 INFO L895 garLoopResultBuilder]: At program point L4850(lines 4849 4893) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,439 INFO L899 garLoopResultBuilder]: For program point L4817(lines 4817 4820) no Hoare annotation was computed. [2022-11-20 12:48:46,439 INFO L895 garLoopResultBuilder]: At program point L3661(lines 3655 3663) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,439 INFO L895 garLoopResultBuilder]: At program point L4487(lines 4486 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,439 INFO L899 garLoopResultBuilder]: For program point L4223(lines 4223 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,439 INFO L895 garLoopResultBuilder]: At program point L4289(lines 4277 4290) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,440 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:48:46,440 INFO L895 garLoopResultBuilder]: At program point L5082(lines 5081 5083) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,440 INFO L899 garLoopResultBuilder]: For program point L3959(lines 3959 3965) no Hoare annotation was computed. [2022-11-20 12:48:46,440 INFO L895 garLoopResultBuilder]: At program point L3893(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,440 INFO L895 garLoopResultBuilder]: At program point L3629loopEntry(lines 3629 3635) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,441 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,441 INFO L895 garLoopResultBuilder]: At program point L5050(line 5050) the Hoare annotation is: false [2022-11-20 12:48:46,441 INFO L895 garLoopResultBuilder]: At program point L5116(lines 5115 5117) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,441 INFO L899 garLoopResultBuilder]: For program point L5050-1(lines 5046 5060) no Hoare annotation was computed. [2022-11-20 12:48:46,441 INFO L899 garLoopResultBuilder]: For program point L3630(line 3630) no Hoare annotation was computed. [2022-11-20 12:48:46,442 INFO L895 garLoopResultBuilder]: At program point L4555(line 4555) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,442 INFO L899 garLoopResultBuilder]: For program point L4555-1(line 4555) no Hoare annotation was computed. [2022-11-20 12:48:46,442 INFO L899 garLoopResultBuilder]: For program point L4390(lines 4390 4393) no Hoare annotation was computed. [2022-11-20 12:48:46,442 INFO L899 garLoopResultBuilder]: For program point L4489(lines 4489 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,442 INFO L895 garLoopResultBuilder]: At program point L4357-2(lines 4357 4367) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,443 INFO L899 garLoopResultBuilder]: For program point L4357(lines 4357 4367) no Hoare annotation was computed. [2022-11-20 12:48:46,443 INFO L899 garLoopResultBuilder]: For program point L4390-2(lines 4390 4393) no Hoare annotation was computed. [2022-11-20 12:48:46,443 INFO L899 garLoopResultBuilder]: For program point L4159(lines 4159 4163) no Hoare annotation was computed. [2022-11-20 12:48:46,443 INFO L899 garLoopResultBuilder]: For program point L4060(line 4060) no Hoare annotation was computed. [2022-11-20 12:48:46,443 INFO L899 garLoopResultBuilder]: For program point L4159-2(lines 4159 4163) no Hoare annotation was computed. [2022-11-20 12:48:46,444 INFO L899 garLoopResultBuilder]: For program point L3928(line 3928) no Hoare annotation was computed. [2022-11-20 12:48:46,444 INFO L895 garLoopResultBuilder]: At program point L4490(lines 4489 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,444 INFO L899 garLoopResultBuilder]: For program point L4589(lines 4589 4596) no Hoare annotation was computed. [2022-11-20 12:48:46,444 INFO L899 garLoopResultBuilder]: For program point L4226(lines 4226 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,444 INFO L895 garLoopResultBuilder]: At program point L5151(lines 5150 5152) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (<= 1 ~ldv_urb_state~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (not (= |ULTIMATE.start_ir_set_termios_~urb~0#1.base| 0)) (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) (<= ~ldv_urb_state~0 1) (not (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (= |ULTIMATE.start_ir_set_termios_~urb~0#1.offset| 0) (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) [2022-11-20 12:48:46,445 INFO L895 garLoopResultBuilder]: At program point L5085(lines 5084 5086) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,445 INFO L899 garLoopResultBuilder]: For program point L3929(lines 3929 3935) no Hoare annotation was computed. [2022-11-20 12:48:46,445 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,445 INFO L895 garLoopResultBuilder]: At program point L4227(lines 4226 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,445 INFO L899 garLoopResultBuilder]: For program point L4194(lines 4194 4198) no Hoare annotation was computed. [2022-11-20 12:48:46,446 INFO L899 garLoopResultBuilder]: For program point L4194-2(lines 4194 4198) no Hoare annotation was computed. [2022-11-20 12:48:46,446 INFO L895 garLoopResultBuilder]: At program point L5119(lines 5118 5120) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,446 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:48:46,446 INFO L895 garLoopResultBuilder]: At program point L4062(lines 3974 4064) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,446 INFO L899 garLoopResultBuilder]: For program point L4492(lines 4492 4548) no Hoare annotation was computed. [2022-11-20 12:48:46,447 INFO L895 garLoopResultBuilder]: At program point L4294-2(lines 4294 4302) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,447 INFO L895 garLoopResultBuilder]: At program point L3997loopEntry(lines 3997 4007) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,447 INFO L899 garLoopResultBuilder]: For program point L3898(line 3898) no Hoare annotation was computed. [2022-11-20 12:48:46,447 INFO L899 garLoopResultBuilder]: For program point L4394(lines 4394 4397) no Hoare annotation was computed. [2022-11-20 12:48:46,447 INFO L895 garLoopResultBuilder]: At program point L4493(lines 4492 4548) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,448 INFO L899 garLoopResultBuilder]: For program point L4295(lines 4294 4302) no Hoare annotation was computed. [2022-11-20 12:48:46,448 INFO L899 garLoopResultBuilder]: For program point L4229(lines 4229 4266) no Hoare annotation was computed. [2022-11-20 12:48:46,448 INFO L899 garLoopResultBuilder]: For program point L3998(line 3998) no Hoare annotation was computed. [2022-11-20 12:48:46,448 INFO L899 garLoopResultBuilder]: For program point L3899(lines 3899 3905) no Hoare annotation was computed. [2022-11-20 12:48:46,448 INFO L895 garLoopResultBuilder]: At program point L3833(lines 3820 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,449 INFO L899 garLoopResultBuilder]: For program point L4824(line 4824) no Hoare annotation was computed. [2022-11-20 12:48:46,449 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4266) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,449 INFO L899 garLoopResultBuilder]: For program point L4296(lines 4296 4299) no Hoare annotation was computed. [2022-11-20 12:48:46,449 INFO L899 garLoopResultBuilder]: For program point L4164(lines 4164 4168) no Hoare annotation was computed. [2022-11-20 12:48:46,449 INFO L895 garLoopResultBuilder]: At program point L5122(line 5122) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 12:48:46,449 INFO L899 garLoopResultBuilder]: For program point L4164-2(lines 4164 4168) no Hoare annotation was computed. [2022-11-20 12:48:46,450 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4909 4914) the Hoare annotation is: true [2022-11-20 12:48:46,450 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4909 4914) no Hoare annotation was computed. [2022-11-20 12:48:46,450 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4909 4914) no Hoare annotation was computed. [2022-11-20 12:48:46,450 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4912) no Hoare annotation was computed. [2022-11-20 12:48:46,454 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:48:46,457 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:48:46,482 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,483 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,484 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,485 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,492 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,493 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,494 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,504 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,505 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,506 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,507 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,509 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,510 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,511 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,512 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,513 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,514 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:46,515 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,516 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:46,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:48:46 BoogieIcfgContainer [2022-11-20 12:48:46,518 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:48:46,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:48:46,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:48:46,519 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:48:46,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:54" (3/4) ... [2022-11-20 12:48:46,524 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:48:46,532 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_xbof_change [2022-11-20 12:48:46,532 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_init [2022-11-20 12:48:46,532 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-20 12:48:46,532 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-11-20 12:48:46,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __kfifo_uint_must_check_helper [2022-11-20 12:48:46,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-20 12:48:46,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2022-11-20 12:48:46,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 12:48:46,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ir_exit [2022-11-20 12:48:46,533 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_serial_deregister [2022-11-20 12:48:46,534 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-11-20 12:48:46,534 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2022-11-20 12:48:46,535 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-11-20 12:48:46,557 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 171 nodes and edges [2022-11-20 12:48:46,560 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2022-11-20 12:48:46,562 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-20 12:48:46,564 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-20 12:48:46,567 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 12:48:46,569 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 12:48:46,572 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:48:46,574 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:48:46,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(ldv_urb_state) <= 1) || ((ldv_urb_state == 0 && urb == urb) && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state)) [2022-11-20 12:48:46,612 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0) [2022-11-20 12:48:46,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && urb == 0) && 0 == \result [2022-11-20 12:48:46,613 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) [2022-11-20 12:48:46,614 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0) [2022-11-20 12:48:46,615 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0) [2022-11-20 12:48:46,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) [2022-11-20 12:48:46,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || (\old(xbof___0) == xbof___0 && (48 <= \old(xbof___0) || \old(xbof___0) + 208 <= 0))) || !(ldv_urb_state == 0) [2022-11-20 12:48:46,616 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2022-11-20 12:48:46,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 24 <= \old(xbof___0)) || 228 + \old(xbof___0) <= 0) || !(ir_add_bof == 0)) && ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) [2022-11-20 12:48:46,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) && ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 5 <= \old(xbof___0)) || !(ir_add_bof == 0)) || \old(xbof___0) + 250 <= 0) [2022-11-20 12:48:46,617 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(xbof___0) + 253 <= 0 || 3 <= \old(xbof___0)) && \old(xbof___0) == xbof___0) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2022-11-20 12:48:46,618 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(xbof___0) == xbof___0 && (\old(xbof___0) + 254 <= 0 || 2 <= \old(xbof___0))) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2022-11-20 12:48:46,618 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(xbof___0) == xbof___0 && (1 <= \old(xbof___0) || \old(xbof___0) + 255 <= 0)) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) [2022-11-20 12:48:46,618 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2022-11-20 12:48:46,619 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 [2022-11-20 12:48:46,619 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && 0 == \result) || (((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && 0 == \result) [2022-11-20 12:48:46,619 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-11-20 12:48:46,620 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (ldv_urb_state == \old(ldv_urb_state) && urb == urb) [2022-11-20 12:48:46,621 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-11-20 12:48:46,621 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-11-20 12:48:46,622 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result [2022-11-20 12:48:46,939 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:48:46,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:48:46,940 INFO L158 Benchmark]: Toolchain (without parser) took 236714.67ms. Allocated memory was 188.7MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 154.7MB in the beginning and 789.3MB in the end (delta: -634.5MB). Peak memory consumption was 797.6MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,947 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 134.2MB. Free memory was 108.0MB in the beginning and 107.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:48:46,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1753.23ms. Allocated memory is still 188.7MB. Free memory was 154.7MB in the beginning and 122.1MB in the end (delta: 32.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.35ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 112.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,950 INFO L158 Benchmark]: Boogie Preprocessor took 97.73ms. Allocated memory is still 188.7MB. Free memory was 112.6MB in the beginning and 103.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,950 INFO L158 Benchmark]: RCFGBuilder took 2549.44ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 103.2MB in the beginning and 142.3MB in the end (delta: -39.1MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,954 INFO L158 Benchmark]: TraceAbstraction took 231736.76ms. Allocated memory was 283.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 141.3MB in the beginning and 832.3MB in the end (delta: -691.0MB). Peak memory consumption was 916.4MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,954 INFO L158 Benchmark]: Witness Printer took 420.26ms. Allocated memory is still 1.6GB. Free memory was 832.3MB in the beginning and 789.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-20 12:48:46,957 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.32ms. Allocated memory is still 134.2MB. Free memory was 108.0MB in the beginning and 107.9MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1753.23ms. Allocated memory is still 188.7MB. Free memory was 154.7MB in the beginning and 122.1MB in the end (delta: 32.7MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.35ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 112.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.73ms. Allocated memory is still 188.7MB. Free memory was 112.6MB in the beginning and 103.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2549.44ms. Allocated memory was 188.7MB in the beginning and 283.1MB in the end (delta: 94.4MB). Free memory was 103.2MB in the beginning and 142.3MB in the end (delta: -39.1MB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * TraceAbstraction took 231736.76ms. Allocated memory was 283.1MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 141.3MB in the beginning and 832.3MB in the end (delta: -691.0MB). Peak memory consumption was 916.4MB. Max. memory is 16.1GB. * Witness Printer took 420.26ms. Allocated memory is still 1.6GB. Free memory was 832.3MB in the beginning and 789.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 4912]: 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 14 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 231.6s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 30.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 179.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15457 SdHoareTripleChecker+Valid, 21.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15128 mSDsluCounter, 49664 SdHoareTripleChecker+Invalid, 18.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41887 mSDsCounter, 2508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12902 IncrementalHoareTripleChecker+Invalid, 15410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2508 mSolverCounterUnsat, 7777 mSDtfsCounter, 12902 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 892 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2931occurred in iteration=11, InterpolantAutomatonStates: 213, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 5231 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 138 LocationsWithAnnotation, 5258 PreInvPairs, 6546 NumberOfFragments, 1793 HoareAnnotationTreeSize, 5258 FomulaSimplifications, 1658464 FormulaSimplificationTreeSizeReduction, 158.2s HoareSimplificationTime, 138 FomulaSimplificationsInter, 23712355 FormulaSimplificationTreeSizeReductionInter, 20.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1807 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1887 ConstructedInterpolants, 0 QuantifiedInterpolants, 4301 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4359 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 115/123 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: 4918]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4089]: Loop Invariant Derived loop invariant: ((\old(xbof___0) == xbof___0 && (1 <= \old(xbof___0) || \old(xbof___0) + 255 <= 0)) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 4068]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || (\old(xbof___0) == xbof___0 && (48 <= \old(xbof___0) || \old(xbof___0) + 208 <= 0))) || !(ldv_urb_state == 0) - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4128]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4837]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5111]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5142]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4468]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4333]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4332]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5150]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4294]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4469]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5121]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5124]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4278]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4273]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4514]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4489]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4811]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5128]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4616]: Loop Invariant [2022-11-20 12:48:47,001 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,008 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,009 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,010 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) - InvariantResult [Line: 4217]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4151]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4379]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5115]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3974]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5013]: Loop Invariant Derived loop invariant: ((!(\old(ldv_urb_state) <= 1) || ((ldv_urb_state == 0 && urb == urb) && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state)) - InvariantResult [Line: 4495]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4486]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (((\old(xbof___0) + 253 <= 0 || 3 <= \old(xbof___0)) && \old(xbof___0) == xbof___0) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 4226]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5104]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4849]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5044]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5077]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5118]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4293]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5067]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 24 <= \old(xbof___0)) || 228 + \old(xbof___0) <= 0) || !(ir_add_bof == 0)) && ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) - InvariantResult [Line: 4823]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4498]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3818]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5084]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4616]: Loop Invariant [2022-11-20 12:48:47,017 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,020 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,021 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,022 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0)) || (((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && !(retval == 0)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) - InvariantResult [Line: 5017]: Loop Invariant Derived loop invariant: ((!(\old(ldv_urb_state) <= 1) || !(ldv_coherent_state == 0)) || !(1 <= \old(ldv_urb_state))) || (ldv_urb_state == \old(ldv_urb_state) && urb == urb) - InvariantResult [Line: 4077]: Loop Invariant Derived loop invariant: ((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0) && ((((!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || 5 <= \old(xbof___0)) || !(ir_add_bof == 0)) || \old(xbof___0) + 250 <= 0) - InvariantResult [Line: 4092]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 5081]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3678]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4013]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4512]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4799]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4096]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 4234]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3981]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3629]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4467]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 4501]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4214]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4510]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4094]: Loop Invariant Derived loop invariant: (!(ldv_coherent_state == 0) || !(ldv_urb_state == 0)) || \old(xbof___0) == xbof___0 - InvariantResult [Line: 5091]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4840]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5107]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4086]: Loop Invariant Derived loop invariant: ((\old(xbof___0) == xbof___0 && (\old(xbof___0) + 254 <= 0 || 2 <= \old(xbof___0))) || !(ldv_coherent_state == 0)) || !(ldv_urb_state == 0) - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3820]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4277]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4843]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4492]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4987]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && 0 == \result) || (((((ldv_coherent_state == 0 && arbitrary_memory == 0) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && 0 == \result) - InvariantResult [Line: 3655]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4220]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4037]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4312]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4458]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && urb == 0) && 0 == \result - InvariantResult [Line: 4507]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4992]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5063]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4504]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5135]: Loop Invariant [2022-11-20 12:48:47,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,045 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,046 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,047 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0) - InvariantResult [Line: 3699]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 1 <= ldv_urb_state) && arbitrary_memory == 0) && !(urb == 0)) && !(arbitrary_memory == 0)) && ldv_urb_state <= 1) && !(\result == 0)) && urb == 0) && 0 == \result - InvariantResult [Line: 3689]: Loop Invariant [2022-11-20 12:48:47,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,048 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,049 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0) - InvariantResult [Line: 3822]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 5146]: Loop Invariant [2022-11-20 12:48:47,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,052 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-20 12:48:47,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-20 12:48:47,054 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((!(\old(unknown-#memory_int-unknown)[xbof][xbof] + 1 <= 0) || ((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$ == \old(#memory_$Pointer$))) || !(0 <= \old(unknown-#memory_int-unknown)[xbof][xbof] + 1)) || !(\old(unknown-#memory_int-unknown)[debug][debug] == 0)) || !(ldv_coherent_state == 0)) || !(\old(unknown-#memory_int-unknown)[buffer_size][buffer_size] == 0)) || !(ldv_urb_state == 0)) || !(ir_add_bof == 0) - InvariantResult [Line: 5094]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && unknown-#memory_int-unknown[buffer_size][buffer_size] == 0) && ir_add_bof == 0) && unknown-#memory_int-unknown[xbof][xbof] + 1 <= 0) && ldv_urb_state == 0) && unknown-#memory_int-unknown[debug][debug] == 0) && 0 <= unknown-#memory_int-unknown[xbof][xbof] + 1 - InvariantResult [Line: 4846]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 RESULT: Ultimate proved your program to be correct! [2022-11-20 12:48:47,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33a57047-67a6-4646-8fa1-591a04d34972/bin/uautomizer-ug76WZFUDN/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