./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/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_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/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_8f52c0d4-085d-4eb5-a389-bb20726d32db/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 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- 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 10:46:34,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:46:34,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:46:34,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:46:34,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:46:34,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:46:34,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:46:34,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:46:34,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:46:34,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:46:34,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:46:34,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:46:34,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:46:34,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:46:34,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:46:34,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:46:34,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:46:34,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:46:34,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:46:34,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:46:34,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:46:34,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:46:34,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:46:34,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:46:34,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:46:34,524 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:46:34,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:46:34,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:46:34,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:46:34,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:46:34,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:46:34,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:46:34,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:46:34,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:46:34,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:46:34,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:46:34,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:46:34,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:46:34,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:46:34,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:46:34,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:46:34,539 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:46:34,579 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:46:34,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:46:34,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:46:34,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:46:34,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:46:34,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:46:34,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:46:34,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:46:34,583 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:46:34,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:46:34,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:46:34,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:46:34,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:46:34,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:46:34,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:46:34,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:46:34,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:46:34,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:46:34,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:46:34,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:46:34,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:46:34,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:46:34,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:46:34,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:46:34,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:46:34,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:46:34,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:46:34,590 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:46:34,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:46:34,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:46:34,591 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_8f52c0d4-085d-4eb5-a389-bb20726d32db/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_8f52c0d4-085d-4eb5-a389-bb20726d32db/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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-11-20 10:46:34,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:46:34,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:46:34,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:46:34,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:46:34,901 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:46:34,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-20 10:46:37,951 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:46:38,406 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:46:38,407 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-20 10:46:38,441 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/data/bf39e0cc5/7019020c32e149bd87865d3ca2d30231/FLAG94ede36e2 [2022-11-20 10:46:38,460 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/data/bf39e0cc5/7019020c32e149bd87865d3ca2d30231 [2022-11-20 10:46:38,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:46:38,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:46:38,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:46:38,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:46:38,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:46:38,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:46:38" (1/1) ... [2022-11-20 10:46:38,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:38, skipping insertion in model container [2022-11-20 10:46:38,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:46:38" (1/1) ... [2022-11-20 10:46:38,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:46:38,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:46:39,435 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_8f52c0d4-085d-4eb5-a389-bb20726d32db/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-20 10:46:39,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:46:39,550 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:46:39,803 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_8f52c0d4-085d-4eb5-a389-bb20726d32db/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-20 10:46:39,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:46:39,870 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:46:39,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39 WrapperNode [2022-11-20 10:46:39,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:46:39,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:46:39,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:46:39,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:46:39,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:39,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:39,997 INFO L138 Inliner]: procedures = 77, calls = 264, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 743 [2022-11-20 10:46:40,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:46:40,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:46:40,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:46:40,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:46:40,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,079 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:46:40,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:46:40,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:46:40,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:46:40,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (1/1) ... [2022-11-20 10:46:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:46:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:40,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:46:40,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:46:40,186 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-11-20 10:46:40,187 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-11-20 10:46:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:46:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-20 10:46:40,187 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-20 10:46:40,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:46:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-20 10:46:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-20 10:46:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-11-20 10:46:40,188 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-11-20 10:46:40,188 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-20 10:46:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-20 10:46:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:46:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:46:40,189 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-20 10:46:40,189 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-20 10:46:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 10:46:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 10:46:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-20 10:46:40,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-20 10:46:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:46:40,190 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-20 10:46:40,191 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-20 10:46:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:46:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 10:46:40,191 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 10:46:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:46:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-20 10:46:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-20 10:46:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-20 10:46:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-20 10:46:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-20 10:46:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-20 10:46:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-20 10:46:40,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-20 10:46:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:46:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:46:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:46:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:46:40,513 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:46:40,516 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:46:40,687 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-20 10:46:40,727 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-20 10:46:41,763 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-20 10:46:41,763 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-20 10:46:41,783 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:46:41,799 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:46:41,800 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 10:46:41,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:46:41 BoogieIcfgContainer [2022-11-20 10:46:41,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:46:41,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:46:41,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:46:41,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:46:41,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:46:38" (1/3) ... [2022-11-20 10:46:41,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baf4680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:46:41, skipping insertion in model container [2022-11-20 10:46:41,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:46:39" (2/3) ... [2022-11-20 10:46:41,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1baf4680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:46:41, skipping insertion in model container [2022-11-20 10:46:41,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:46:41" (3/3) ... [2022-11-20 10:46:41,816 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-20 10:46:41,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:46:41,837 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:46:41,920 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:46:41,928 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;@58ad1082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:46:41,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:46:41,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 128 states have internal predecessors, (160), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-20 10:46:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-20 10:46:41,943 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:41,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:41,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:41,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1435834942, now seen corresponding path program 1 times [2022-11-20 10:46:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:41,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93880549] [2022-11-20 10:46:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:42,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:42,540 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 10:46:42,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:42,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93880549] [2022-11-20 10:46:42,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93880549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:42,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:42,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:46:42,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092487660] [2022-11-20 10:46:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:42,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:46:42,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:46:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:42,604 INFO L87 Difference]: Start difference. First operand has 164 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 128 states have internal predecessors, (160), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 10:46:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:42,693 INFO L93 Difference]: Finished difference Result 450 states and 610 transitions. [2022-11-20 10:46:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:46:42,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-11-20 10:46:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:42,707 INFO L225 Difference]: With dead ends: 450 [2022-11-20 10:46:42,708 INFO L226 Difference]: Without dead ends: 289 [2022-11-20 10:46:42,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:42,723 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 186 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:42,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:46:42,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-20 10:46:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-11-20 10:46:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 212 states have (on average 1.2264150943396226) internal successors, (260), 216 states have internal predecessors, (260), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-11-20 10:46:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 354 transitions. [2022-11-20 10:46:42,830 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 354 transitions. Word has length 17 [2022-11-20 10:46:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:42,831 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 354 transitions. [2022-11-20 10:46:42,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 10:46:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 354 transitions. [2022-11-20 10:46:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 10:46:42,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:42,832 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 10:46:42,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:46:42,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:42,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1561331946, now seen corresponding path program 1 times [2022-11-20 10:46:42,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:42,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897715507] [2022-11-20 10:46:42,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,083 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 10:46:43,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:43,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897715507] [2022-11-20 10:46:43,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897715507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:43,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:43,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:46:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015499552] [2022-11-20 10:46:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:43,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:46:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:46:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:43,092 INFO L87 Difference]: Start difference. First operand 285 states and 354 transitions. Second operand has 3 states, 3 states have (on average 5.0) 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 10:46:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:43,190 INFO L93 Difference]: Finished difference Result 826 states and 1033 transitions. [2022-11-20 10:46:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:46:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) 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 10:46:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:43,206 INFO L225 Difference]: With dead ends: 826 [2022-11-20 10:46:43,206 INFO L226 Difference]: Without dead ends: 546 [2022-11-20 10:46:43,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:46:43,209 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 176 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:43,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 423 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:46:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-20 10:46:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 539. [2022-11-20 10:46:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 402 states have (on average 1.2189054726368158) internal successors, (490), 405 states have internal predecessors, (490), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-20 10:46:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 670 transitions. [2022-11-20 10:46:43,286 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 670 transitions. Word has length 18 [2022-11-20 10:46:43,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:43,286 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 670 transitions. [2022-11-20 10:46:43,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) 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 10:46:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 670 transitions. [2022-11-20 10:46:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-20 10:46:43,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:43,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:46:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:46:43,289 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1930446545, now seen corresponding path program 1 times [2022-11-20 10:46:43,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:43,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972407970] [2022-11-20 10:46:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:43,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-20 10:46:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:43,651 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 10:46:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972407970] [2022-11-20 10:46:43,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972407970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:43,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:43,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:46:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540616288] [2022-11-20 10:46:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:43,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:46:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:46:43,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:46:43,657 INFO L87 Difference]: Start difference. First operand 539 states and 670 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:46:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:44,136 INFO L93 Difference]: Finished difference Result 1241 states and 1582 transitions. [2022-11-20 10:46:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:46:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-11-20 10:46:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:44,144 INFO L225 Difference]: With dead ends: 1241 [2022-11-20 10:46:44,145 INFO L226 Difference]: Without dead ends: 713 [2022-11-20 10:46:44,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:46:44,155 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 150 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:44,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 503 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:46:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-20 10:46:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 610. [2022-11-20 10:46:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 473 states have (on average 1.2494714587737843) internal successors, (591), 476 states have internal predecessors, (591), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-20 10:46:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 771 transitions. [2022-11-20 10:46:44,212 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 771 transitions. Word has length 51 [2022-11-20 10:46:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:44,212 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 771 transitions. [2022-11-20 10:46:44,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 10:46:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 771 transitions. [2022-11-20 10:46:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:46:44,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:44,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:44,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:46:44,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:44,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1713485533, now seen corresponding path program 1 times [2022-11-20 10:46:44,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:44,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293647725] [2022-11-20 10:46:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:44,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:46:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:46:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293647725] [2022-11-20 10:46:45,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293647725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614945098] [2022-11-20 10:46:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:45,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:45,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:45,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:45,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:46:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:45,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-20 10:46:45,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 10:46:45,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:45,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614945098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:45,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:46:45,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-20 10:46:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489067222] [2022-11-20 10:46:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:45,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:46:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:46:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:46:45,995 INFO L87 Difference]: Start difference. First operand 610 states and 771 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:46:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:46,065 INFO L93 Difference]: Finished difference Result 1212 states and 1533 transitions. [2022-11-20 10:46:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:46:46,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-11-20 10:46:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:46,069 INFO L225 Difference]: With dead ends: 1212 [2022-11-20 10:46:46,069 INFO L226 Difference]: Without dead ends: 610 [2022-11-20 10:46:46,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-20 10:46:46,072 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 2 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:46,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 922 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:46:46,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-20 10:46:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-11-20 10:46:46,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 473 states have (on average 1.2473572938689217) internal successors, (590), 476 states have internal predecessors, (590), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-20 10:46:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 770 transitions. [2022-11-20 10:46:46,115 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 770 transitions. Word has length 86 [2022-11-20 10:46:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:46,116 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 770 transitions. [2022-11-20 10:46:46,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 10:46:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 770 transitions. [2022-11-20 10:46:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:46:46,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:46,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:46,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:46,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:46,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:46,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:46,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1473245787, now seen corresponding path program 1 times [2022-11-20 10:46:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:46,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025220110] [2022-11-20 10:46:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:46:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:46:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025220110] [2022-11-20 10:46:47,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025220110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:47,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164951712] [2022-11-20 10:46:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:47,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:47,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:46:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:47,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-20 10:46:47,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:46:47,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:47,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164951712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:47,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:46:47,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-20 10:46:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988392003] [2022-11-20 10:46:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:47,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:46:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:46:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:46:47,768 INFO L87 Difference]: Start difference. First operand 610 states and 770 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:46:47,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:47,856 INFO L93 Difference]: Finished difference Result 1195 states and 1536 transitions. [2022-11-20 10:46:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:46:47,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-20 10:46:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:47,860 INFO L225 Difference]: With dead ends: 1195 [2022-11-20 10:46:47,860 INFO L226 Difference]: Without dead ends: 598 [2022-11-20 10:46:47,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:46:47,863 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 42 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:47,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 683 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:46:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-20 10:46:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 428. [2022-11-20 10:46:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 333 states have (on average 1.2372372372372373) internal successors, (412), 336 states have internal predecessors, (412), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-11-20 10:46:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 532 transitions. [2022-11-20 10:46:47,904 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 532 transitions. Word has length 86 [2022-11-20 10:46:47,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:47,906 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 532 transitions. [2022-11-20 10:46:47,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:46:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 532 transitions. [2022-11-20 10:46:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:46:47,908 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:47,908 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:47,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:48,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:48,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash -656088645, now seen corresponding path program 1 times [2022-11-20 10:46:48,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:48,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098821924] [2022-11-20 10:46:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:46:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:46:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:46:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:48,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098821924] [2022-11-20 10:46:48,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098821924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:48,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508253801] [2022-11-20 10:46:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:48,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:48,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:48,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:48,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:46:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:49,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-20 10:46:49,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 10:46:49,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:46:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:46:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508253801] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:46:49,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:46:49,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-11-20 10:46:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401095157] [2022-11-20 10:46:49,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:46:49,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 10:46:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:49,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 10:46:49,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-20 10:46:49,894 INFO L87 Difference]: Start difference. First operand 428 states and 532 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-20 10:46:50,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:50,750 INFO L93 Difference]: Finished difference Result 1043 states and 1336 transitions. [2022-11-20 10:46:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:46:50,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2022-11-20 10:46:50,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:50,755 INFO L225 Difference]: With dead ends: 1043 [2022-11-20 10:46:50,756 INFO L226 Difference]: Without dead ends: 628 [2022-11-20 10:46:50,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:46:50,758 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 137 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:50,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1362 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:46:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-20 10:46:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 464. [2022-11-20 10:46:50,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 360 states have (on average 1.2194444444444446) internal successors, (439), 363 states have internal predecessors, (439), 65 states have call successors, (65), 33 states have call predecessors, (65), 38 states have return successors, (79), 67 states have call predecessors, (79), 61 states have call successors, (79) [2022-11-20 10:46:50,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 583 transitions. [2022-11-20 10:46:50,804 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 583 transitions. Word has length 83 [2022-11-20 10:46:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:50,804 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 583 transitions. [2022-11-20 10:46:50,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-20 10:46:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 583 transitions. [2022-11-20 10:46:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:46:50,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:50,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:50,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:51,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:51,014 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1559086053, now seen corresponding path program 1 times [2022-11-20 10:46:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:51,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809065641] [2022-11-20 10:46:51,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:46:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:46:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:46:51,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:51,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809065641] [2022-11-20 10:46:51,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809065641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:51,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:51,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:46:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443956019] [2022-11-20 10:46:51,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:51,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:46:51,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:46:51,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:46:51,587 INFO L87 Difference]: Start difference. First operand 464 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 10:46:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:52,110 INFO L93 Difference]: Finished difference Result 1009 states and 1315 transitions. [2022-11-20 10:46:52,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:46:52,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-11-20 10:46:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:52,114 INFO L225 Difference]: With dead ends: 1009 [2022-11-20 10:46:52,115 INFO L226 Difference]: Without dead ends: 673 [2022-11-20 10:46:52,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:46:52,117 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 94 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:52,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1363 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:46:52,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-20 10:46:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 479. [2022-11-20 10:46:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 372 states have (on average 1.2123655913978495) internal successors, (451), 372 states have internal predecessors, (451), 65 states have call successors, (65), 33 states have call predecessors, (65), 41 states have return successors, (84), 73 states have call predecessors, (84), 61 states have call successors, (84) [2022-11-20 10:46:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 600 transitions. [2022-11-20 10:46:52,162 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 600 transitions. Word has length 83 [2022-11-20 10:46:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:52,163 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 600 transitions. [2022-11-20 10:46:52,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 10:46:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2022-11-20 10:46:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:46:52,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:52,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:52,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:46:52,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:52,174 INFO L85 PathProgramCache]: Analyzing trace with hash -364422629, now seen corresponding path program 2 times [2022-11-20 10:46:52,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:52,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003103815] [2022-11-20 10:46:52,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:52,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:46:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:46:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 10:46:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003103815] [2022-11-20 10:46:52,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003103815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:52,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615385649] [2022-11-20 10:46:52,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:46:52,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:52,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:52,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:46:53,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:46:53,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:46:53,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 10:46:53,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:53,507 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 10:46:53,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:53,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615385649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:53,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:46:53,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-20 10:46:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819947870] [2022-11-20 10:46:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:53,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:46:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:53,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:46:53,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:46:53,509 INFO L87 Difference]: Start difference. First operand 479 states and 600 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:46:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:53,727 INFO L93 Difference]: Finished difference Result 1072 states and 1375 transitions. [2022-11-20 10:46:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:46:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-11-20 10:46:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:53,732 INFO L225 Difference]: With dead ends: 1072 [2022-11-20 10:46:53,733 INFO L226 Difference]: Without dead ends: 606 [2022-11-20 10:46:53,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:46:53,735 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 151 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:53,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1754 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:46:53,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-20 10:46:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 477. [2022-11-20 10:46:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 370 states have (on average 1.2) internal successors, (444), 371 states have internal predecessors, (444), 65 states have call successors, (65), 33 states have call predecessors, (65), 41 states have return successors, (84), 72 states have call predecessors, (84), 61 states have call successors, (84) [2022-11-20 10:46:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 593 transitions. [2022-11-20 10:46:53,778 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 593 transitions. Word has length 83 [2022-11-20 10:46:53,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:53,778 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 593 transitions. [2022-11-20 10:46:53,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:46:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 593 transitions. [2022-11-20 10:46:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 10:46:53,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:53,780 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:53,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:53,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:53,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:53,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:53,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1107763325, now seen corresponding path program 1 times [2022-11-20 10:46:53,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99841766] [2022-11-20 10:46:53,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:46:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-20 10:46:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99841766] [2022-11-20 10:46:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99841766] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:46:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80237358] [2022-11-20 10:46:54,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:54,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:46:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:46:54,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:46:54,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:46:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:55,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:46:55,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:46:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:46:55,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:46:55,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80237358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:55,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:46:55,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-11-20 10:46:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120207982] [2022-11-20 10:46:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:55,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:46:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:55,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:46:55,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:46:55,430 INFO L87 Difference]: Start difference. First operand 477 states and 593 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:46:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:55,655 INFO L93 Difference]: Finished difference Result 746 states and 926 transitions. [2022-11-20 10:46:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:46:55,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-20 10:46:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:55,660 INFO L225 Difference]: With dead ends: 746 [2022-11-20 10:46:55,660 INFO L226 Difference]: Without dead ends: 743 [2022-11-20 10:46:55,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:46:55,666 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 281 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:55,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 383 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:46:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-20 10:46:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 717. [2022-11-20 10:46:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 558 states have (on average 1.2060931899641576) internal successors, (673), 557 states have internal predecessors, (673), 93 states have call successors, (93), 51 states have call predecessors, (93), 65 states have return successors, (130), 108 states have call predecessors, (130), 89 states have call successors, (130) [2022-11-20 10:46:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 896 transitions. [2022-11-20 10:46:55,733 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 896 transitions. Word has length 86 [2022-11-20 10:46:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 896 transitions. [2022-11-20 10:46:55,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 10:46:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 896 transitions. [2022-11-20 10:46:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 10:46:55,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:55,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:55,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 10:46:55,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-20 10:46:55,945 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2015789822, now seen corresponding path program 1 times [2022-11-20 10:46:55,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:55,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83511106] [2022-11-20 10:46:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-20 10:46:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:46:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-20 10:46:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:56,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83511106] [2022-11-20 10:46:56,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83511106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:56,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:56,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:46:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573276083] [2022-11-20 10:46:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:46:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:46:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:46:56,215 INFO L87 Difference]: Start difference. First operand 717 states and 896 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-20 10:46:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:56,647 INFO L93 Difference]: Finished difference Result 1432 states and 1788 transitions. [2022-11-20 10:46:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:46:56,647 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-11-20 10:46:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:56,651 INFO L225 Difference]: With dead ends: 1432 [2022-11-20 10:46:56,651 INFO L226 Difference]: Without dead ends: 706 [2022-11-20 10:46:56,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:46:56,653 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 116 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:56,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 668 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:46:56,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-20 10:46:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 667. [2022-11-20 10:46:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 518 states have (on average 1.196911196911197) internal successors, (620), 519 states have internal predecessors, (620), 90 states have call successors, (90), 45 states have call predecessors, (90), 58 states have return successors, (124), 102 states have call predecessors, (124), 86 states have call successors, (124) [2022-11-20 10:46:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 834 transitions. [2022-11-20 10:46:56,725 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 834 transitions. Word has length 96 [2022-11-20 10:46:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:56,725 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 834 transitions. [2022-11-20 10:46:56,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-20 10:46:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 834 transitions. [2022-11-20 10:46:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 10:46:56,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:56,728 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:56,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:46:56,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1914487614, now seen corresponding path program 1 times [2022-11-20 10:46:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:56,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612974810] [2022-11-20 10:46:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:46:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:46:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:46:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 10:46:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:57,250 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 10:46:57,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612974810] [2022-11-20 10:46:57,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612974810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:57,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:57,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:46:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560082514] [2022-11-20 10:46:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:57,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:46:57,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:57,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:46:57,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:46:57,255 INFO L87 Difference]: Start difference. First operand 667 states and 834 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:46:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:58,128 INFO L93 Difference]: Finished difference Result 1187 states and 1524 transitions. [2022-11-20 10:46:58,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:46:58,128 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-20 10:46:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:58,134 INFO L225 Difference]: With dead ends: 1187 [2022-11-20 10:46:58,134 INFO L226 Difference]: Without dead ends: 875 [2022-11-20 10:46:58,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:46:58,136 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 183 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:58,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1188 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:46:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-11-20 10:46:58,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 675. [2022-11-20 10:46:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 524 states have (on average 1.1946564885496183) internal successors, (626), 525 states have internal predecessors, (626), 90 states have call successors, (90), 45 states have call predecessors, (90), 60 states have return successors, (126), 104 states have call predecessors, (126), 86 states have call successors, (126) [2022-11-20 10:46:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 842 transitions. [2022-11-20 10:46:58,212 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 842 transitions. Word has length 105 [2022-11-20 10:46:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:58,213 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 842 transitions. [2022-11-20 10:46:58,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:46:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 842 transitions. [2022-11-20 10:46:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 10:46:58,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:58,216 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:58,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:46:58,216 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:58,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash -747675683, now seen corresponding path program 1 times [2022-11-20 10:46:58,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:58,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196596596] [2022-11-20 10:46:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:46:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:46:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:46:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:46:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:46:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:46:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:46:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:46:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:46:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:46:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 10:46:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:46:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-20 10:46:58,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:46:58,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196596596] [2022-11-20 10:46:58,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196596596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:46:58,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:46:58,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 10:46:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979037856] [2022-11-20 10:46:58,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:46:58,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 10:46:58,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:46:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 10:46:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:46:58,870 INFO L87 Difference]: Start difference. First operand 675 states and 842 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:46:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:46:59,856 INFO L93 Difference]: Finished difference Result 913 states and 1165 transitions. [2022-11-20 10:46:59,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 10:46:59,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-20 10:46:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:46:59,861 INFO L225 Difference]: With dead ends: 913 [2022-11-20 10:46:59,861 INFO L226 Difference]: Without dead ends: 871 [2022-11-20 10:46:59,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-20 10:46:59,863 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 297 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 10:46:59,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1676 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 10:46:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-11-20 10:46:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 677. [2022-11-20 10:46:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 526 states have (on average 1.193916349809886) internal successors, (628), 527 states have internal predecessors, (628), 90 states have call successors, (90), 45 states have call predecessors, (90), 60 states have return successors, (126), 104 states have call predecessors, (126), 86 states have call successors, (126) [2022-11-20 10:46:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 844 transitions. [2022-11-20 10:46:59,943 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 844 transitions. Word has length 105 [2022-11-20 10:46:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:46:59,944 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 844 transitions. [2022-11-20 10:46:59,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:46:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 844 transitions. [2022-11-20 10:46:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-20 10:46:59,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:46:59,946 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:46:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:46:59,947 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:46:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:46:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1055307428, now seen corresponding path program 1 times [2022-11-20 10:46:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:46:59,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927743294] [2022-11-20 10:46:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:46:59,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:47:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 10:47:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 10:47:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 10:47:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:00,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927743294] [2022-11-20 10:47:00,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927743294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:00,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:00,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:47:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976610802] [2022-11-20 10:47:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:00,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:47:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:47:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:00,385 INFO L87 Difference]: Start difference. First operand 677 states and 844 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 10:47:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:00,922 INFO L93 Difference]: Finished difference Result 1271 states and 1594 transitions. [2022-11-20 10:47:00,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:47:00,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2022-11-20 10:47:00,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:00,927 INFO L225 Difference]: With dead ends: 1271 [2022-11-20 10:47:00,927 INFO L226 Difference]: Without dead ends: 647 [2022-11-20 10:47:00,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:47:00,930 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 107 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:00,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 488 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-20 10:47:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 635. [2022-11-20 10:47:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 492 states have (on average 1.1869918699186992) internal successors, (584), 495 states have internal predecessors, (584), 86 states have call successors, (86), 45 states have call predecessors, (86), 56 states have return successors, (114), 94 states have call predecessors, (114), 82 states have call successors, (114) [2022-11-20 10:47:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 784 transitions. [2022-11-20 10:47:01,033 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 784 transitions. Word has length 106 [2022-11-20 10:47:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:01,034 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 784 transitions. [2022-11-20 10:47:01,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 10:47:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 784 transitions. [2022-11-20 10:47:01,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-20 10:47:01,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:01,037 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:01,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:47:01,037 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:01,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1982538561, now seen corresponding path program 1 times [2022-11-20 10:47:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:01,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868069174] [2022-11-20 10:47:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 10:47:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 10:47:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:47:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 10:47:01,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:01,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868069174] [2022-11-20 10:47:01,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868069174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:01,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:01,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:47:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929481017] [2022-11-20 10:47:01,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:01,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:47:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:47:01,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:47:01,610 INFO L87 Difference]: Start difference. First operand 635 states and 784 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-20 10:47:02,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:02,748 INFO L93 Difference]: Finished difference Result 1855 states and 2292 transitions. [2022-11-20 10:47:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 10:47:02,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 108 [2022-11-20 10:47:02,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:02,755 INFO L225 Difference]: With dead ends: 1855 [2022-11-20 10:47:02,755 INFO L226 Difference]: Without dead ends: 1242 [2022-11-20 10:47:02,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:47:02,758 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 689 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:02,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 682 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 10:47:02,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-11-20 10:47:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1146. [2022-11-20 10:47:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 888 states have (on average 1.1925675675675675) internal successors, (1059), 894 states have internal predecessors, (1059), 155 states have call successors, (155), 81 states have call predecessors, (155), 102 states have return successors, (208), 170 states have call predecessors, (208), 150 states have call successors, (208) [2022-11-20 10:47:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1422 transitions. [2022-11-20 10:47:02,910 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1422 transitions. Word has length 108 [2022-11-20 10:47:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:02,910 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1422 transitions. [2022-11-20 10:47:02,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-20 10:47:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1422 transitions. [2022-11-20 10:47:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-20 10:47:02,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:02,913 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:02,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:47:02,913 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash -858991793, now seen corresponding path program 1 times [2022-11-20 10:47:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:02,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652435255] [2022-11-20 10:47:02,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 10:47:03,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:03,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652435255] [2022-11-20 10:47:03,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652435255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:03,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:03,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:47:03,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706202438] [2022-11-20 10:47:03,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:03,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:03,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:03,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:03,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:03,890 INFO L87 Difference]: Start difference. First operand 1146 states and 1422 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:47:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:04,245 INFO L93 Difference]: Finished difference Result 1780 states and 2207 transitions. [2022-11-20 10:47:04,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:04,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2022-11-20 10:47:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:04,249 INFO L225 Difference]: With dead ends: 1780 [2022-11-20 10:47:04,249 INFO L226 Difference]: Without dead ends: 678 [2022-11-20 10:47:04,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:04,254 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 64 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:04,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 561 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:47:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-20 10:47:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 643. [2022-11-20 10:47:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 498 states have (on average 1.1827309236947792) internal successors, (589), 501 states have internal predecessors, (589), 87 states have call successors, (87), 46 states have call predecessors, (87), 57 states have return successors, (114), 95 states have call predecessors, (114), 82 states have call successors, (114) [2022-11-20 10:47:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 790 transitions. [2022-11-20 10:47:04,332 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 790 transitions. Word has length 117 [2022-11-20 10:47:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:04,332 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 790 transitions. [2022-11-20 10:47:04,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-20 10:47:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 790 transitions. [2022-11-20 10:47:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-20 10:47:04,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:04,335 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:04,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:47:04,335 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1996925200, now seen corresponding path program 1 times [2022-11-20 10:47:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:04,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725756356] [2022-11-20 10:47:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 10:47:04,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:04,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725756356] [2022-11-20 10:47:04,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725756356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:04,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:04,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:47:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993213928] [2022-11-20 10:47:04,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:04,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:47:04,874 INFO L87 Difference]: Start difference. First operand 643 states and 790 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-20 10:47:05,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:05,404 INFO L93 Difference]: Finished difference Result 1241 states and 1534 transitions. [2022-11-20 10:47:05,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:47:05,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 117 [2022-11-20 10:47:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:05,410 INFO L225 Difference]: With dead ends: 1241 [2022-11-20 10:47:05,411 INFO L226 Difference]: Without dead ends: 1236 [2022-11-20 10:47:05,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:05,412 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 268 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:05,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 559 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 10:47:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-11-20 10:47:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1175. [2022-11-20 10:47:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 911 states have (on average 1.1909989023051593) internal successors, (1085), 916 states have internal predecessors, (1085), 159 states have call successors, (159), 82 states have call predecessors, (159), 104 states have return successors, (222), 176 states have call predecessors, (222), 154 states have call successors, (222) [2022-11-20 10:47:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1466 transitions. [2022-11-20 10:47:05,542 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1466 transitions. Word has length 117 [2022-11-20 10:47:05,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:05,542 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1466 transitions. [2022-11-20 10:47:05,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-20 10:47:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1466 transitions. [2022-11-20 10:47:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 10:47:05,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:05,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:05,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 10:47:05,545 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash 365160195, now seen corresponding path program 1 times [2022-11-20 10:47:05,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:05,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395053342] [2022-11-20 10:47:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 10:47:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 10:47:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-20 10:47:06,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:06,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395053342] [2022-11-20 10:47:06,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395053342] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836445471] [2022-11-20 10:47:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:06,618 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:06,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:47:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:07,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 10:47:07,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 10:47:07,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:47:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836445471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:07,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:47:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-11-20 10:47:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275750480] [2022-11-20 10:47:07,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:07,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:07,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-20 10:47:07,442 INFO L87 Difference]: Start difference. First operand 1175 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 10:47:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:07,634 INFO L93 Difference]: Finished difference Result 1246 states and 1548 transitions. [2022-11-20 10:47:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2022-11-20 10:47:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:07,642 INFO L225 Difference]: With dead ends: 1246 [2022-11-20 10:47:07,642 INFO L226 Difference]: Without dead ends: 1227 [2022-11-20 10:47:07,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:47:07,644 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 217 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:07,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:07,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-11-20 10:47:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1175. [2022-11-20 10:47:07,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 911 states have (on average 1.1866081229418222) internal successors, (1081), 916 states have internal predecessors, (1081), 159 states have call successors, (159), 82 states have call predecessors, (159), 104 states have return successors, (222), 176 states have call predecessors, (222), 154 states have call successors, (222) [2022-11-20 10:47:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1462 transitions. [2022-11-20 10:47:07,814 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1462 transitions. Word has length 130 [2022-11-20 10:47:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:07,814 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1462 transitions. [2022-11-20 10:47:07,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 10:47:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1462 transitions. [2022-11-20 10:47:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-20 10:47:07,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:07,816 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:07,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:08,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 10:47:08,026 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash -556379909, now seen corresponding path program 1 times [2022-11-20 10:47:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:08,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937694326] [2022-11-20 10:47:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 10:47:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 10:47:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 10:47:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:08,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937694326] [2022-11-20 10:47:08,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937694326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:08,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333351995] [2022-11-20 10:47:08,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:08,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:08,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:08,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:08,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:47:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:09,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:47:09,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-20 10:47:09,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:47:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333351995] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:09,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:47:09,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-20 10:47:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126268676] [2022-11-20 10:47:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:09,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:47:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:47:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:09,399 INFO L87 Difference]: Start difference. First operand 1175 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 10:47:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:09,514 INFO L93 Difference]: Finished difference Result 1665 states and 2070 transitions. [2022-11-20 10:47:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 10:47:09,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2022-11-20 10:47:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:09,517 INFO L225 Difference]: With dead ends: 1665 [2022-11-20 10:47:09,518 INFO L226 Difference]: Without dead ends: 523 [2022-11-20 10:47:09,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:47:09,521 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 45 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:09,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 417 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-20 10:47:09,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-11-20 10:47:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 398 states have (on average 1.1231155778894473) internal successors, (447), 401 states have internal predecessors, (447), 73 states have call successors, (73), 41 states have call predecessors, (73), 51 states have return successors, (94), 80 states have call predecessors, (94), 69 states have call successors, (94) [2022-11-20 10:47:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 614 transitions. [2022-11-20 10:47:09,580 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 614 transitions. Word has length 134 [2022-11-20 10:47:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:09,580 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 614 transitions. [2022-11-20 10:47:09,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 10:47:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 614 transitions. [2022-11-20 10:47:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-20 10:47:09,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:09,583 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:09,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:09,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 10:47:09,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:09,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash -407074935, now seen corresponding path program 1 times [2022-11-20 10:47:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:09,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825686083] [2022-11-20 10:47:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 10:47:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 10:47:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 10:47:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 10:47:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 10:47:10,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:10,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825686083] [2022-11-20 10:47:10,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825686083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:10,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:10,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:47:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664540031] [2022-11-20 10:47:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:47:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:47:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:47:10,312 INFO L87 Difference]: Start difference. First operand 523 states and 614 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-20 10:47:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:10,768 INFO L93 Difference]: Finished difference Result 844 states and 998 transitions. [2022-11-20 10:47:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:47:10,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 147 [2022-11-20 10:47:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:10,772 INFO L225 Difference]: With dead ends: 844 [2022-11-20 10:47:10,772 INFO L226 Difference]: Without dead ends: 390 [2022-11-20 10:47:10,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:47:10,774 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 205 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:10,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 477 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 10:47:10,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-20 10:47:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 379. [2022-11-20 10:47:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.1176470588235294) internal successors, (323), 292 states have internal predecessors, (323), 54 states have call successors, (54), 31 states have call predecessors, (54), 35 states have return successors, (62), 55 states have call predecessors, (62), 50 states have call successors, (62) [2022-11-20 10:47:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 439 transitions. [2022-11-20 10:47:10,820 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 439 transitions. Word has length 147 [2022-11-20 10:47:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:10,821 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 439 transitions. [2022-11-20 10:47:10,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-20 10:47:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 439 transitions. [2022-11-20 10:47:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-20 10:47:10,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:10,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:10,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 10:47:10,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:10,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:10,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1779093938, now seen corresponding path program 1 times [2022-11-20 10:47:10,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:10,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333610903] [2022-11-20 10:47:10,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:10,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 10:47:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 10:47:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 10:47:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-20 10:47:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 10:47:11,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:11,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333610903] [2022-11-20 10:47:11,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333610903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:11,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:47:11,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:47:11,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346879807] [2022-11-20 10:47:11,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:11,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:47:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:11,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:47:11,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:47:11,865 INFO L87 Difference]: Start difference. First operand 379 states and 439 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-20 10:47:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:12,491 INFO L93 Difference]: Finished difference Result 399 states and 457 transitions. [2022-11-20 10:47:12,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:47:12,492 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 149 [2022-11-20 10:47:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:12,494 INFO L225 Difference]: With dead ends: 399 [2022-11-20 10:47:12,494 INFO L226 Difference]: Without dead ends: 345 [2022-11-20 10:47:12,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:47:12,496 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 438 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:12,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 674 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 10:47:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-20 10:47:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2022-11-20 10:47:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 190 states have internal predecessors, (205), 34 states have call successors, (34), 22 states have call predecessors, (34), 24 states have return successors, (37), 33 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-20 10:47:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 276 transitions. [2022-11-20 10:47:12,526 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 276 transitions. Word has length 149 [2022-11-20 10:47:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:12,526 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 276 transitions. [2022-11-20 10:47:12,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-20 10:47:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 276 transitions. [2022-11-20 10:47:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-20 10:47:12,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:47:12,529 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:47:12,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 10:47:12,530 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:47:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:47:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash -148329902, now seen corresponding path program 1 times [2022-11-20 10:47:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:47:12,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972654685] [2022-11-20 10:47:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:47:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:47:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:47:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 10:47:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-20 10:47:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 10:47:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 10:47:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 10:47:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:47:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 10:47:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 10:47:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 10:47:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 10:47:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 10:47:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-20 10:47:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-20 10:47:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:47:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 10:47:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:47:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972654685] [2022-11-20 10:47:13,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972654685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:47:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470323256] [2022-11-20 10:47:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:47:13,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:47:13,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:47:13,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:47:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:47:14,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 10:47:14,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:47:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-20 10:47:14,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:47:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470323256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:47:14,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:47:14,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-11-20 10:47:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629542548] [2022-11-20 10:47:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:47:14,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:47:14,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:47:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:47:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-11-20 10:47:14,714 INFO L87 Difference]: Start difference. First operand 246 states and 276 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-20 10:47:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:47:14,815 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2022-11-20 10:47:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:47:14,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 178 [2022-11-20 10:47:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:47:14,818 INFO L225 Difference]: With dead ends: 252 [2022-11-20 10:47:14,818 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:47:14,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-20 10:47:14,821 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 38 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:47:14,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 578 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:47:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:47:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:47:14,822 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 10:47:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:47:14,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2022-11-20 10:47:14,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:47:14,823 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:47:14,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-20 10:47:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:47:14,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:47:14,826 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:47:14,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 10:47:15,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:47:15,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 10:47:23,557 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-11-20 10:47:23,557 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-11-20 10:47:23,557 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-11-20 10:47:23,557 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-11-20 10:47:23,557 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-11-20 10:47:23,557 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-11-20 10:47:23,558 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-11-20 10:47:23,558 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-11-20 10:47:23,558 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-11-20 10:47:23,558 INFO L895 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (<= 1 ~ldv_urb_state~0)) (not (<= 1 ~ldv_coherent_state~0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_urb_state~0 1)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-20 10:47:23,558 INFO L895 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (<= 1 ~ldv_urb_state~0)) (not (<= 1 ~ldv_coherent_state~0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_urb_state~0 1)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-20 10:47:23,558 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-11-20 10:47:23,559 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-11-20 10:47:23,559 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-11-20 10:47:23,559 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-11-20 10:47:23,559 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-11-20 10:47:23,559 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-11-20 10:47:23,559 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-11-20 10:47:23,559 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-11-20 10:47:23,559 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-11-20 10:47:23,560 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-11-20 10:47:23,560 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-11-20 10:47:23,560 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 (not (<= 1 ~ldv_coherent_state~0)) .cse1 .cse2 (not (<= ~ldv_coherent_state~0 1))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2022-11-20 10:47:23,560 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-11-20 10:47:23,560 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-11-20 10:47:23,560 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-11-20 10:47:23,560 INFO L895 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-20 10:47:23,561 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-11-20 10:47:23,561 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-20 10:47:23,561 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-11-20 10:47:23,561 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-11-20 10:47:23,561 INFO L895 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (and (= ~ldv_urb_state~0 0) (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 (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-20 10:47:23,561 INFO L895 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-20 10:47:23,562 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-11-20 10:47:23,562 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-11-20 10:47:23,562 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-11-20 10:47:23,562 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-11-20 10:47:23,562 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-11-20 10:47:23,562 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-11-20 10:47:23,562 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-11-20 10:47:23,562 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-11-20 10:47:23,563 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (not (<= 1 ~ldv_coherent_state~0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0))) (.cse4 (not (<= ~ldv_coherent_state~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse2 .cse3) (or (not (<= 1 ~ldv_urb_state~0)) .cse1 .cse2 .cse3 (not (<= ~ldv_urb_state~0 1)) .cse4))) [2022-11-20 10:47:23,563 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-11-20 10:47:23,570 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-11-20 10:47:23,570 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-11-20 10:47:23,571 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) 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 10:47:23,571 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-11-20 10:47:23,571 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-11-20 10:47:23,571 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-11-20 10:47:23,571 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-11-20 10:47:23,571 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) 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 10:47:23,572 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-11-20 10:47:23,572 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-11-20 10:47:23,572 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-11-20 10:47:23,572 INFO L895 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 0) (let ((.cse0 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* 18446744073709551616 .cse1))) (<= (+ .cse1 1) 0)))))) [2022-11-20 10:47:23,572 INFO L895 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~ldv_urb_state~0 0))) [2022-11-20 10:47:23,572 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-11-20 10:47:23,572 INFO L895 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (not (= ~ldv_urb_state~0 0))) [2022-11-20 10:47:23,573 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-11-20 10:47:23,573 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-11-20 10:47:23,573 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-11-20 10:47:23,573 INFO L895 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~ldv_urb_state~0 0))) [2022-11-20 10:47:23,573 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-11-20 10:47:23,573 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-11-20 10:47:23,573 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 10:47:23,573 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-11-20 10:47:23,574 INFO L895 garLoopResultBuilder]: At program point L3454-1(line 3454) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,574 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-20 10:47:23,574 INFO L895 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,574 INFO L895 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,574 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-11-20 10:47:23,574 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-11-20 10:47:23,574 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-11-20 10:47:23,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 10:47:23,575 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-11-20 10:47:23,575 INFO L895 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-20 10:47:23,575 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-11-20 10:47:23,575 INFO L895 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,575 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-11-20 10:47:23,575 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-11-20 10:47:23,576 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-11-20 10:47:23,576 INFO L895 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,576 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-11-20 10:47:23,576 INFO L895 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,576 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and .cse0 (<= (+ 12 ~res_kbtab_probe_3~0) 0) .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (not .cse3) .cse4 .cse1 .cse2 (not .cse5)) (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse5 .cse4 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) .cse2 .cse3))) [2022-11-20 10:47:23,576 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-11-20 10:47:23,576 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-11-20 10:47:23,577 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-11-20 10:47:23,578 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-20 10:47:23,578 INFO L895 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,578 INFO L895 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse4 (= ~ldv_coherent_state~0 0)) (.cse0 (= 0 ~res_kbtab_probe_3~0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse5 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) .cse2 .cse3) (and .cse4 .cse5 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse4 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (not .cse3) .cse1 .cse5 .cse2))) [2022-11-20 10:47:23,578 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-11-20 10:47:23,578 INFO L895 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,578 INFO L895 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,579 INFO L895 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,579 INFO L895 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-20 10:47:23,582 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-11-20 10:47:23,582 INFO L895 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-20 10:47:23,583 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-20 10:47:23,583 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-11-20 10:47:23,583 INFO L895 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,583 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 10:47:23,583 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-11-20 10:47:23,584 INFO L895 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-20 10:47:23,584 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-11-20 10:47:23,584 INFO L895 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,584 INFO L895 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,584 INFO L895 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,585 INFO L895 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,585 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-11-20 10:47:23,585 INFO L895 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and (not .cse0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) .cse1 (<= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2022-11-20 10:47:23,585 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,585 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-11-20 10:47:23,585 INFO L895 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2022-11-20 10:47:23,586 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-11-20 10:47:23,586 INFO L895 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,586 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-11-20 10:47:23,586 INFO L895 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 10:47:23,586 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-11-20 10:47:23,587 INFO L895 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| 0) .cse1 .cse2 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) .cse3))) [2022-11-20 10:47:23,588 INFO L895 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| 0) .cse1 .cse2 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) .cse3))) [2022-11-20 10:47:23,588 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-11-20 10:47:23,589 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,589 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-11-20 10:47:23,589 INFO L895 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-20 10:47:23,589 INFO L895 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,589 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-20 10:47:23,590 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-11-20 10:47:23,590 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-11-20 10:47:23,590 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-11-20 10:47:23,590 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-20 10:47:23,590 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-11-20 10:47:23,590 INFO L895 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse7 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse6) (and .cse7 .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-11-20 10:47:23,591 INFO L895 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse7 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse6) (and .cse7 .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-11-20 10:47:23,591 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse6 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse1 (= 0 ~res_kbtab_probe_3~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-20 10:47:23,591 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-11-20 10:47:23,591 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 10:47:23,591 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,592 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-11-20 10:47:23,592 INFO L895 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,593 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-11-20 10:47:23,593 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-11-20 10:47:23,593 INFO L895 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse6 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse1 (= 0 ~res_kbtab_probe_3~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-20 10:47:23,593 INFO L895 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse4 (= ~ldv_urb_state~0 0)) (.cse9 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) (.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse10 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse5 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse7 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= 1 ~ldv_urb_state~0) .cse1 .cse10 .cse2 .cse5 (<= ~ldv_urb_state~0 1) .cse6 .cse7 (not .cse3) .cse8))) [2022-11-20 10:47:23,593 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-11-20 10:47:23,594 INFO L895 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,594 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-11-20 10:47:23,594 INFO L895 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-20 10:47:23,594 INFO L895 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse6 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|))) (.cse7 (<= ~ldv_coherent_state~0 1)) (.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse8 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (and (<= 1 ~ldv_urb_state~0) .cse6 .cse1 .cse2 .cse3 .cse7 (<= ~ldv_urb_state~0 1) .cse8) (and .cse6 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse8))) [2022-11-20 10:47:23,594 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-20 10:47:23,595 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-11-20 10:47:23,595 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-11-20 10:47:23,595 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-11-20 10:47:23,596 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-11-20 10:47:23,596 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-11-20 10:47:23,596 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-11-20 10:47:23,596 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-11-20 10:47:23,601 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:47:23,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:47:23,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:47:23 BoogieIcfgContainer [2022-11-20 10:47:23,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:47:23,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:47:23,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:47:23,675 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:47:23,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:46:41" (3/4) ... [2022-11-20 10:47:23,679 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:47:23,685 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-11-20 10:47:23,685 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-11-20 10:47:23,685 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-20 10:47:23,685 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-11-20 10:47:23,685 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-11-20 10:47:23,686 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-11-20 10:47:23,687 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-11-20 10:47:23,687 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-11-20 10:47:23,706 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-11-20 10:47:23,707 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-20 10:47:23,709 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-20 10:47:23,710 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:47:23,711 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:47:23,712 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 10:47:23,749 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-20 10:47:23,749 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(ldv_urb_state) <= 1) || (ldv_urb_state == 0 && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) [2022-11-20 10:47:23,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || !(ldv_urb_state == 0)) || (ldv_coherent_state == 0 && (!(addr + addr <= 18446744073709551616 * ((addr + addr) / 18446744073709551616)) || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2022-11-20 10:47:23,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) || ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) [2022-11-20 10:47:23,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-20 10:47:23,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && !(ldv_s_kbtab_driver_usb_driver == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) [2022-11-20 10:47:23,750 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0 [2022-11-20 10:47:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(ldv_urb_state == 0) [2022-11-20 10:47:23,753 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-20 10:47:23,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) [2022-11-20 10:47:23,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 [2022-11-20 10:47:23,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 [2022-11-20 10:47:23,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == arbitrary_memory) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) [2022-11-20 10:47:23,754 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result)) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) [2022-11-20 10:47:23,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(ldv_urb_state) <= 1) || ldv_urb_state == \old(ldv_urb_state)) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) [2022-11-20 10:47:23,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,755 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,756 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-20 10:47:23,757 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2022-11-20 10:47:23,919 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:47:23,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:47:23,919 INFO L158 Benchmark]: Toolchain (without parser) took 45455.08ms. Allocated memory was 184.5MB in the beginning and 796.9MB in the end (delta: 612.4MB). Free memory was 132.1MB in the beginning and 304.3MB in the end (delta: -172.2MB). Peak memory consumption was 443.1MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,920 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 184.5MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:47:23,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1405.50ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 131.8MB in the beginning and 184.1MB in the end (delta: -52.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.81ms. Allocated memory is still 251.7MB. Free memory was 184.1MB in the beginning and 178.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,927 INFO L158 Benchmark]: Boogie Preprocessor took 86.34ms. Allocated memory is still 251.7MB. Free memory was 178.9MB in the beginning and 172.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,927 INFO L158 Benchmark]: RCFGBuilder took 1712.58ms. Allocated memory is still 251.7MB. Free memory was 172.6MB in the beginning and 140.6MB in the end (delta: 32.0MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,928 INFO L158 Benchmark]: TraceAbstraction took 41868.18ms. Allocated memory was 251.7MB in the beginning and 796.9MB in the end (delta: 545.3MB). Free memory was 139.6MB in the beginning and 323.1MB in the end (delta: -183.6MB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,930 INFO L158 Benchmark]: Witness Printer took 244.16ms. Allocated memory is still 796.9MB. Free memory was 323.1MB in the beginning and 304.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:47:23,932 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.37ms. Allocated memory is still 184.5MB. Free memory was 145.8MB in the beginning and 145.7MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1405.50ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 131.8MB in the beginning and 184.1MB in the end (delta: -52.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.81ms. Allocated memory is still 251.7MB. Free memory was 184.1MB in the beginning and 178.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.34ms. Allocated memory is still 251.7MB. Free memory was 178.9MB in the beginning and 172.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1712.58ms. Allocated memory is still 251.7MB. Free memory was 172.6MB in the beginning and 140.6MB in the end (delta: 32.0MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41868.18ms. Allocated memory was 251.7MB in the beginning and 796.9MB in the end (delta: 545.3MB). Free memory was 139.6MB in the beginning and 323.1MB in the end (delta: -183.6MB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. * Witness Printer took 244.16ms. Allocated memory is still 796.9MB. Free memory was 323.1MB in the beginning and 304.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4049]: 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 15 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.7s, OverallIterations: 21, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4049 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3886 mSDsluCounter, 16217 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12188 mSDsCounter, 1203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5574 IncrementalHoareTripleChecker+Invalid, 6777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1203 mSolverCounterUnsat, 4029 mSDtfsCounter, 5574 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1615 GetRequests, 1397 SyntacticMatches, 5 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1175occurred in iteration=16, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 1596 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 2821 PreInvPairs, 2961 NumberOfFragments, 2188 HoareAnnotationTreeSize, 2821 FomulaSimplifications, 268149 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 82 FomulaSimplificationsInter, 33710 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 2951 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3004 ConstructedInterpolants, 0 QuantifiedInterpolants, 6227 SizeOfPredicates, 35 NumberOfNonLiveVariables, 11687 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 938/1004 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: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(ldv_urb_state == 0) - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) || ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || !(ldv_urb_state == 0)) || (ldv_coherent_state == 0 && (!(addr + addr <= 18446744073709551616 * ((addr + addr) / 18446744073709551616)) || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: ((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: (((((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result)) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == arbitrary_memory) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ((((!(\old(ldv_urb_state) <= 1) || (ldv_urb_state == 0 && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((((!(\old(ldv_urb_state) <= 1) || ldv_urb_state == \old(ldv_urb_state)) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3454]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && !(ldv_s_kbtab_driver_usb_driver == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 10:47:23,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f52c0d4-085d-4eb5-a389-bb20726d32db/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