./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8 --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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- 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-e04fb08 [2022-11-16 12:18:00,808 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:18:00,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:18:00,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:18:00,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:18:00,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:18:00,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:18:00,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:18:00,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:18:00,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:18:00,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:18:00,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:18:00,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:18:00,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:18:00,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:18:00,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:18:00,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:18:00,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:18:00,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:18:00,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:18:00,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:18:00,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:18:00,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:18:00,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:18:00,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:18:00,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:18:00,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:18:00,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:18:00,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:18:00,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:18:00,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:18:00,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:18:00,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:18:00,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:18:00,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:18:00,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:18:00,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:18:00,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:18:00,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:18:00,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:18:00,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:18:00,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:18:00,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:18:00,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:18:00,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:18:00,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:18:00,931 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:18:00,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:18:00,932 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:18:00,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:18:00,933 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:18:00,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:18:00,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:18:00,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:18:00,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:18:00,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:18:00,934 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:18:00,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:18:00,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:18:00,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:18:00,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:18:00,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:18:00,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:18:00,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:18:00,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:18:00,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:18:00,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:18:00,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:18:00,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:18:00,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:18:00,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:18:00,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:18:00,938 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_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/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_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-11-16 12:18:01,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:18:01,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:18:01,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:18:01,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:18:01,231 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:18:01,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-16 12:18:01,311 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/ec9246d74/26158ebc394f4bdba62d98df27d38448/FLAG6ba3a3206 [2022-11-16 12:18:02,262 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:18:02,263 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-16 12:18:02,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/ec9246d74/26158ebc394f4bdba62d98df27d38448/FLAG6ba3a3206 [2022-11-16 12:18:02,730 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/ec9246d74/26158ebc394f4bdba62d98df27d38448 [2022-11-16 12:18:02,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:18:02,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:18:02,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:18:02,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:18:02,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:18:02,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:02" (1/1) ... [2022-11-16 12:18:02,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39faafed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:02, skipping insertion in model container [2022-11-16 12:18:02,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:18:02" (1/1) ... [2022-11-16 12:18:02,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:18:02,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:18:04,129 WARN L229 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_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-16 12:18:04,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:18:04,237 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:18:04,544 WARN L229 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_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-16 12:18:04,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:18:05,047 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:18:05,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05 WrapperNode [2022-11-16 12:18:05,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:18:05,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:18:05,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:18:05,051 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:18:05,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,249 INFO L138 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1671 [2022-11-16 12:18:05,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:18:05,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:18:05,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:18:05,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:18:05,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,421 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:18:05,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:18:05,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:18:05,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:18:05,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (1/1) ... [2022-11-16 12:18:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:18:05,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:05,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:18:05,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:18:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-16 12:18:05,576 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-16 12:18:05,576 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-11-16 12:18:05,576 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-11-16 12:18:05,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-16 12:18:05,577 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-16 12:18:05,577 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-16 12:18:05,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 12:18:05,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 12:18:05,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:18:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-16 12:18:05,578 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-16 12:18:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-16 12:18:05,578 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-16 12:18:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-11-16 12:18:05,578 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-11-16 12:18:05,578 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-11-16 12:18:05,579 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-11-16 12:18:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-11-16 12:18:05,580 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-11-16 12:18:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 12:18:05,580 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 12:18:05,580 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-16 12:18:05,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-16 12:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:18:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-11-16 12:18:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-11-16 12:18:05,581 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-16 12:18:05,581 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-16 12:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:18:05,582 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-16 12:18:05,582 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-16 12:18:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-16 12:18:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-16 12:18:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-16 12:18:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-16 12:18:05,583 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-16 12:18:05,583 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-16 12:18:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 12:18:05,584 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 12:18:05,584 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-16 12:18:05,584 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-16 12:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-11-16 12:18:05,585 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-11-16 12:18:05,585 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-16 12:18:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-16 12:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-16 12:18:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-16 12:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:18:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-11-16 12:18:05,587 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-11-16 12:18:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:18:05,588 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-11-16 12:18:05,589 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-11-16 12:18:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-16 12:18:05,589 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-16 12:18:05,589 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-16 12:18:05,590 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-16 12:18:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-16 12:18:05,591 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-16 12:18:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-11-16 12:18:05,591 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-11-16 12:18:05,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-16 12:18:05,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-16 12:18:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:18:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:18:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-16 12:18:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-16 12:18:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-16 12:18:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-16 12:18:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-16 12:18:05,592 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-16 12:18:05,592 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-16 12:18:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-16 12:18:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-16 12:18:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-16 12:18:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-16 12:18:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-16 12:18:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:18:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-16 12:18:05,593 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-16 12:18:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-16 12:18:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-16 12:18:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:18:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:18:06,108 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:18:06,111 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:18:06,936 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-16 12:18:07,036 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 12:18:07,101 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 12:18:08,319 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-11-16 12:18:08,320 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-11-16 12:18:08,320 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-11-16 12:18:08,320 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-11-16 12:18:08,359 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:18:08,372 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:18:08,372 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-16 12:18:08,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:08 BoogieIcfgContainer [2022-11-16 12:18:08,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:18:08,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:18:08,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:18:08,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:18:08,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:18:02" (1/3) ... [2022-11-16 12:18:08,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bf9c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:08, skipping insertion in model container [2022-11-16 12:18:08,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:18:05" (2/3) ... [2022-11-16 12:18:08,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bf9c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:18:08, skipping insertion in model container [2022-11-16 12:18:08,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:08" (3/3) ... [2022-11-16 12:18:08,385 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-16 12:18:08,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:18:08,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:18:08,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:18:08,529 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;@25ea00bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:18:08,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:18:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 384 states have (on average 1.3880208333333333) internal successors, (533), 397 states have internal predecessors, (533), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-11-16 12:18:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:18:08,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:08,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:08,554 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1394595550, now seen corresponding path program 1 times [2022-11-16 12:18:08,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:08,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559363387] [2022-11-16 12:18:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:09,478 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-16 12:18:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:09,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559363387] [2022-11-16 12:18:09,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559363387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:09,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:09,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:18:09,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973502006] [2022-11-16 12:18:09,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:09,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:18:09,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:18:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:18:09,534 INFO L87 Difference]: Start difference. First operand has 543 states, 384 states have (on average 1.3880208333333333) internal successors, (533), 397 states have internal predecessors, (533), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-16 12:18:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:09,787 INFO L93 Difference]: Finished difference Result 1084 states and 1594 transitions. [2022-11-16 12:18:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:18:09,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-16 12:18:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:09,811 INFO L225 Difference]: With dead ends: 1084 [2022-11-16 12:18:09,811 INFO L226 Difference]: Without dead ends: 544 [2022-11-16 12:18:09,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:18:09,823 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 301 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:09,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3175 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:18:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-16 12:18:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 539. [2022-11-16 12:18:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 382 states have (on average 1.2225130890052356) internal successors, (467), 390 states have internal predecessors, (467), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-11-16 12:18:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 707 transitions. [2022-11-16 12:18:09,915 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 707 transitions. Word has length 17 [2022-11-16 12:18:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:09,916 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 707 transitions. [2022-11-16 12:18:09,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-16 12:18:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 707 transitions. [2022-11-16 12:18:09,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:18:09,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:09,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:18:09,919 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:09,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1001568540, now seen corresponding path program 1 times [2022-11-16 12:18:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:09,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503049137] [2022-11-16 12:18:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:10,140 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-16 12:18:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:10,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503049137] [2022-11-16 12:18:10,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503049137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:10,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:10,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:18:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547015829] [2022-11-16 12:18:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:10,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:10,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:10,145 INFO L87 Difference]: Start difference. First operand 539 states and 707 transitions. 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-16 12:18:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:10,251 INFO L93 Difference]: Finished difference Result 1577 states and 2093 transitions. [2022-11-16 12:18:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:10,251 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-16 12:18:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:10,260 INFO L225 Difference]: With dead ends: 1577 [2022-11-16 12:18:10,260 INFO L226 Difference]: Without dead ends: 1056 [2022-11-16 12:18:10,263 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-16 12:18:10,264 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 690 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1670 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-16 12:18:10,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1670 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:18:10,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-11-16 12:18:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1053. [2022-11-16 12:18:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 746 states have (on average 1.2225201072386058) internal successors, (912), 759 states have internal predecessors, (912), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-11-16 12:18:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1390 transitions. [2022-11-16 12:18:10,428 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1390 transitions. Word has length 17 [2022-11-16 12:18:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:10,428 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1390 transitions. [2022-11-16 12:18:10,429 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-16 12:18:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1390 transitions. [2022-11-16 12:18:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:18:10,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:10,430 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-16 12:18:10,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:18:10,431 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 983594194, now seen corresponding path program 1 times [2022-11-16 12:18:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:10,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454843023] [2022-11-16 12:18:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:10,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:10,684 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-16 12:18:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:10,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454843023] [2022-11-16 12:18:10,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454843023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:10,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:10,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:18:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218734024] [2022-11-16 12:18:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:10,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:18:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:18:10,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:18:10,691 INFO L87 Difference]: Start difference. First operand 1053 states and 1390 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-16 12:18:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:10,781 INFO L93 Difference]: Finished difference Result 1055 states and 1391 transitions. [2022-11-16 12:18:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:18:10,781 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-16 12:18:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:10,790 INFO L225 Difference]: With dead ends: 1055 [2022-11-16 12:18:10,790 INFO L226 Difference]: Without dead ends: 1044 [2022-11-16 12:18:10,795 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-16 12:18:10,799 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 692 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:10,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:18:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-11-16 12:18:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1039. [2022-11-16 12:18:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 736 states have (on average 1.2173913043478262) internal successors, (896), 747 states have internal predecessors, (896), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-11-16 12:18:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1370 transitions. [2022-11-16 12:18:10,917 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1370 transitions. Word has length 18 [2022-11-16 12:18:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:10,918 INFO L495 AbstractCegarLoop]: Abstraction has 1039 states and 1370 transitions. [2022-11-16 12:18:10,918 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-16 12:18:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1370 transitions. [2022-11-16 12:18:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:18:10,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:10,927 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] [2022-11-16 12:18:10,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:18:10,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2065165388, now seen corresponding path program 1 times [2022-11-16 12:18:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518084521] [2022-11-16 12:18:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:10,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:11,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 12:18:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:18:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:11,249 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-16 12:18:11,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:11,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518084521] [2022-11-16 12:18:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518084521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:11,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:18:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939883514] [2022-11-16 12:18:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:18:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:18:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:18:11,253 INFO L87 Difference]: Start difference. First operand 1039 states and 1370 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:18:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:13,270 INFO L93 Difference]: Finished difference Result 2387 states and 3220 transitions. [2022-11-16 12:18:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:18:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-16 12:18:13,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:13,280 INFO L225 Difference]: With dead ends: 2387 [2022-11-16 12:18:13,281 INFO L226 Difference]: Without dead ends: 1360 [2022-11-16 12:18:13,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:18:13,295 INFO L413 NwaCegarLoop]: 614 mSDtfsCounter, 441 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:13,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1242 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-16 12:18:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-11-16 12:18:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1338. [2022-11-16 12:18:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 953 states have (on average 1.2381951731374607) internal successors, (1180), 972 states have internal predecessors, (1180), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-11-16 12:18:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1818 transitions. [2022-11-16 12:18:13,402 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1818 transitions. Word has length 50 [2022-11-16 12:18:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:13,403 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1818 transitions. [2022-11-16 12:18:13,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:18:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1818 transitions. [2022-11-16 12:18:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 12:18:13,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:13,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:18:13,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:18:13,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 960452703, now seen corresponding path program 1 times [2022-11-16 12:18:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:13,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457833295] [2022-11-16 12:18:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:13,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 12:18:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:13,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:18:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:18:13,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457833295] [2022-11-16 12:18:13,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457833295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:13,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:13,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:18:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425911525] [2022-11-16 12:18:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:13,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:18:13,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:13,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:18:13,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:18:13,676 INFO L87 Difference]: Start difference. First operand 1338 states and 1818 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:18:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:15,927 INFO L93 Difference]: Finished difference Result 2703 states and 3678 transitions. [2022-11-16 12:18:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:18:15,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-11-16 12:18:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:15,936 INFO L225 Difference]: With dead ends: 2703 [2022-11-16 12:18:15,936 INFO L226 Difference]: Without dead ends: 1366 [2022-11-16 12:18:15,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-16 12:18:15,942 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 197 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:15,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1637 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 12:18:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2022-11-16 12:18:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1338. [2022-11-16 12:18:16,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 953 states have (on average 1.236096537250787) internal successors, (1178), 974 states have internal predecessors, (1178), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-11-16 12:18:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1812 transitions. [2022-11-16 12:18:16,041 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1812 transitions. Word has length 72 [2022-11-16 12:18:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:16,042 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1812 transitions. [2022-11-16 12:18:16,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:18:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1812 transitions. [2022-11-16 12:18:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-16 12:18:16,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:16,045 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:18:16,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:18:16,046 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1052870136, now seen corresponding path program 1 times [2022-11-16 12:18:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:16,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445324399] [2022-11-16 12:18:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-16 12:18:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445324399] [2022-11-16 12:18:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445324399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158247463] [2022-11-16 12:18:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:16,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:16,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:16,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:16,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:18:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:17,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:18:17,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:17,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:18:17,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:18:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:18:17,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:18:17,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158247463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:17,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:18:17,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-16 12:18:17,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023167796] [2022-11-16 12:18:17,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:17,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:18:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:17,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:18:17,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:18:17,826 INFO L87 Difference]: Start difference. First operand 1338 states and 1812 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-16 12:18:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:19,673 INFO L93 Difference]: Finished difference Result 1400 states and 1892 transitions. [2022-11-16 12:18:19,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:18:19,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-11-16 12:18:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:19,682 INFO L225 Difference]: With dead ends: 1400 [2022-11-16 12:18:19,682 INFO L226 Difference]: Without dead ends: 1340 [2022-11-16 12:18:19,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:18:19,685 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 4 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:19,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3905 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 12:18:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-11-16 12:18:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1338. [2022-11-16 12:18:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 953 states have (on average 1.2339979013641134) internal successors, (1176), 974 states have internal predecessors, (1176), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-11-16 12:18:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1810 transitions. [2022-11-16 12:18:19,826 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1810 transitions. Word has length 146 [2022-11-16 12:18:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:19,827 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1810 transitions. [2022-11-16 12:18:19,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-16 12:18:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1810 transitions. [2022-11-16 12:18:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:18:19,838 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:19,839 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:18:19,853 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:20,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:20,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:20,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:20,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2040585741, now seen corresponding path program 1 times [2022-11-16 12:18:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:20,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157818373] [2022-11-16 12:18:20,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-16 12:18:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:20,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157818373] [2022-11-16 12:18:20,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157818373] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:20,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151224668] [2022-11-16 12:18:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:20,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:20,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:20,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:18:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:18:21,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-16 12:18:21,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:18:21,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151224668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:21,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:18:21,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-11-16 12:18:21,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914038058] [2022-11-16 12:18:21,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:21,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:18:21,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:21,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:18:21,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:18:21,451 INFO L87 Difference]: Start difference. First operand 1338 states and 1810 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:18:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:21,613 INFO L93 Difference]: Finished difference Result 2687 states and 3639 transitions. [2022-11-16 12:18:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:18:21,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 147 [2022-11-16 12:18:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:21,622 INFO L225 Difference]: With dead ends: 2687 [2022-11-16 12:18:21,622 INFO L226 Difference]: Without dead ends: 1359 [2022-11-16 12:18:21,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:18:21,627 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 12 mSDsluCounter, 2807 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:21,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3517 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:18:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-16 12:18:21,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1345. [2022-11-16 12:18:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 958 states have (on average 1.232776617954071) internal successors, (1181), 980 states have internal predecessors, (1181), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-11-16 12:18:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1820 transitions. [2022-11-16 12:18:21,705 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1820 transitions. Word has length 147 [2022-11-16 12:18:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:21,705 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1820 transitions. [2022-11-16 12:18:21,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:18:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1820 transitions. [2022-11-16 12:18:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:18:21,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:21,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:18:21,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:21,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-16 12:18:21,917 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash -273219476, now seen corresponding path program 1 times [2022-11-16 12:18:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:21,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388510708] [2022-11-16 12:18:21,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:21,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:18:23,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388510708] [2022-11-16 12:18:23,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388510708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:23,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022521599] [2022-11-16 12:18:23,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:23,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:23,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:23,827 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:23,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:18:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:24,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-16 12:18:24,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:24,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:18:24,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:18:24,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:24,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:25,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:25,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:25,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-16 12:18:25,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-16 12:18:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-16 12:18:25,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:18:26,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022521599] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:26,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:18:26,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-11-16 12:18:26,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572414860] [2022-11-16 12:18:26,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:26,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:18:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:26,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:18:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-11-16 12:18:26,107 INFO L87 Difference]: Start difference. First operand 1345 states and 1820 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-11-16 12:18:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:32,795 INFO L93 Difference]: Finished difference Result 2454 states and 3312 transitions. [2022-11-16 12:18:32,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 12:18:32,796 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 147 [2022-11-16 12:18:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:32,802 INFO L225 Difference]: With dead ends: 2454 [2022-11-16 12:18:32,803 INFO L226 Difference]: Without dead ends: 1028 [2022-11-16 12:18:32,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 319 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-11-16 12:18:32,809 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 345 mSDsluCounter, 3867 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 4390 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 854 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:32,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 4390 Invalid, 3593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 2492 Invalid, 0 Unknown, 854 Unchecked, 6.4s Time] [2022-11-16 12:18:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-11-16 12:18:32,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1012. [2022-11-16 12:18:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 721 states have (on average 1.2288488210818307) internal successors, (886), 738 states have internal predecessors, (886), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-11-16 12:18:32,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1343 transitions. [2022-11-16 12:18:32,871 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1343 transitions. Word has length 147 [2022-11-16 12:18:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:32,872 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1343 transitions. [2022-11-16 12:18:32,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-11-16 12:18:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1343 transitions. [2022-11-16 12:18:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:18:32,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:32,875 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:32,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:18:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:33,083 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1508280459, now seen corresponding path program 1 times [2022-11-16 12:18:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:33,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199758209] [2022-11-16 12:18:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:33,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:33,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-16 12:18:34,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:34,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199758209] [2022-11-16 12:18:34,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199758209] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:34,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573484060] [2022-11-16 12:18:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:34,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:34,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:34,004 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:34,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:18:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:34,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:18:34,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 12:18:34,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-16 12:18:35,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573484060] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:35,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:18:35,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-11-16 12:18:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268051905] [2022-11-16 12:18:35,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:35,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 12:18:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 12:18:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-16 12:18:35,449 INFO L87 Difference]: Start difference. First operand 1012 states and 1343 transitions. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-11-16 12:18:43,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:43,395 INFO L93 Difference]: Finished difference Result 2091 states and 2798 transitions. [2022-11-16 12:18:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 12:18:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) Word has length 147 [2022-11-16 12:18:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:43,404 INFO L225 Difference]: With dead ends: 2091 [2022-11-16 12:18:43,405 INFO L226 Difference]: Without dead ends: 1393 [2022-11-16 12:18:43,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 321 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 12:18:43,410 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1876 mSDsluCounter, 4394 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 886 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 5027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:43,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 5015 Invalid, 5027 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [886 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-11-16 12:18:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2022-11-16 12:18:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1368. [2022-11-16 12:18:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 971 states have (on average 1.2245108135942326) internal successors, (1189), 993 states have internal predecessors, (1189), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-11-16 12:18:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1820 transitions. [2022-11-16 12:18:43,505 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1820 transitions. Word has length 147 [2022-11-16 12:18:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:43,505 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1820 transitions. [2022-11-16 12:18:43,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-11-16 12:18:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1820 transitions. [2022-11-16 12:18:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-16 12:18:43,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:43,509 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-16 12:18:43,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:18:43,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:43,719 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 783175115, now seen corresponding path program 1 times [2022-11-16 12:18:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:43,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901461704] [2022-11-16 12:18:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:44,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-16 12:18:44,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:44,552 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:18:44,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:44,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901461704] [2022-11-16 12:18:44,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901461704] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:44,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805249815] [2022-11-16 12:18:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:44,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:44,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:44,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:44,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:18:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:45,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:18:45,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:45,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:18:45,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:18:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:18:45,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:18:45,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805249815] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:45,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:18:45,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-11-16 12:18:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848661366] [2022-11-16 12:18:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:18:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:18:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:18:45,632 INFO L87 Difference]: Start difference. First operand 1368 states and 1820 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:18:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:47,002 INFO L93 Difference]: Finished difference Result 1433 states and 1898 transitions. [2022-11-16 12:18:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:18:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-11-16 12:18:47,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:47,011 INFO L225 Difference]: With dead ends: 1433 [2022-11-16 12:18:47,012 INFO L226 Difference]: Without dead ends: 1368 [2022-11-16 12:18:47,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:18:47,014 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 6 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:47,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3331 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-16 12:18:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-11-16 12:18:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2022-11-16 12:18:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 971 states have (on average 1.223480947476828) internal successors, (1188), 993 states have internal predecessors, (1188), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-11-16 12:18:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1819 transitions. [2022-11-16 12:18:47,138 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1819 transitions. Word has length 157 [2022-11-16 12:18:47,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:47,139 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1819 transitions. [2022-11-16 12:18:47,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:18:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1819 transitions. [2022-11-16 12:18:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-16 12:18:47,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:47,144 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-16 12:18:47,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 12:18:47,354 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:47,355 INFO L85 PathProgramCache]: Analyzing trace with hash -635858733, now seen corresponding path program 1 times [2022-11-16 12:18:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:47,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675257390] [2022-11-16 12:18:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:47,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-16 12:18:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:18:48,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:48,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675257390] [2022-11-16 12:18:48,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675257390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:48,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700058739] [2022-11-16 12:18:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:48,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:48,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:18:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:49,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-16 12:18:49,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:49,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:18:49,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:18:49,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:49,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:50,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:50,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:18:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-16 12:18:50,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:18:50,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700058739] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:50,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:18:50,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-11-16 12:18:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263380181] [2022-11-16 12:18:50,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:50,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:18:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:18:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:18:50,450 INFO L87 Difference]: Start difference. First operand 1368 states and 1819 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-11-16 12:18:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:56,463 INFO L93 Difference]: Finished difference Result 2442 states and 3268 transitions. [2022-11-16 12:18:56,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:18:56,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 158 [2022-11-16 12:18:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:56,472 INFO L225 Difference]: With dead ends: 2442 [2022-11-16 12:18:56,474 INFO L226 Difference]: Without dead ends: 1370 [2022-11-16 12:18:56,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 344 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-11-16 12:18:56,478 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 188 mSDsluCounter, 4142 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 4653 SdHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:56,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 4653 Invalid, 3876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2969 Invalid, 0 Unknown, 790 Unchecked, 5.8s Time] [2022-11-16 12:18:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2022-11-16 12:18:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2022-11-16 12:18:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 971 states have (on average 1.223480947476828) internal successors, (1188), 993 states have internal predecessors, (1188), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (328), 297 states have call predecessors, (328), 300 states have call successors, (328) [2022-11-16 12:18:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1818 transitions. [2022-11-16 12:18:56,561 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1818 transitions. Word has length 158 [2022-11-16 12:18:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:56,561 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1818 transitions. [2022-11-16 12:18:56,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-11-16 12:18:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1818 transitions. [2022-11-16 12:18:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-16 12:18:56,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:56,565 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:18:56,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:18:56,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:56,774 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:18:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:56,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1143023629, now seen corresponding path program 2 times [2022-11-16 12:18:56,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:56,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140722729] [2022-11-16 12:18:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:56,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:18:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:18:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:18:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:18:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:18:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:18:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:18:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:18:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:18:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:58,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:18:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:18:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-16 12:18:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:58,082 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 12:18:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:58,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140722729] [2022-11-16 12:18:58,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140722729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:18:58,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662153512] [2022-11-16 12:18:58,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:18:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:18:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:18:58,084 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:18:58,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:18:58,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:18:58,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:18:58,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1943 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 12:18:58,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:18:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-16 12:18:59,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:18:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-16 12:18:59,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662153512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:18:59,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:18:59,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-11-16 12:18:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53405667] [2022-11-16 12:18:59,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:18:59,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 12:18:59,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:59,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 12:18:59,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:18:59,756 INFO L87 Difference]: Start difference. First operand 1368 states and 1818 transitions. Second operand has 20 states, 20 states have (on average 8.6) internal successors, (172), 18 states have internal predecessors, (172), 13 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (42), 11 states have call predecessors, (42), 12 states have call successors, (42) [2022-11-16 12:19:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:07,241 INFO L93 Difference]: Finished difference Result 1796 states and 2349 transitions. [2022-11-16 12:19:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 12:19:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.6) internal successors, (172), 18 states have internal predecessors, (172), 13 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (42), 11 states have call predecessors, (42), 12 states have call successors, (42) Word has length 158 [2022-11-16 12:19:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:07,253 INFO L225 Difference]: With dead ends: 1796 [2022-11-16 12:19:07,253 INFO L226 Difference]: Without dead ends: 1782 [2022-11-16 12:19:07,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 347 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2022-11-16 12:19:07,255 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 6297 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 4149 mSolverCounterSat, 3189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6522 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 7338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3189 IncrementalHoareTripleChecker+Valid, 4149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:07,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6522 Valid, 3858 Invalid, 7338 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3189 Valid, 4149 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-16 12:19:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-11-16 12:19:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1733. [2022-11-16 12:19:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1227 states have (on average 1.2208638956805216) internal successors, (1498), 1256 states have internal predecessors, (1498), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 371 states have call predecessors, (411), 376 states have call successors, (411) [2022-11-16 12:19:07,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2287 transitions. [2022-11-16 12:19:07,369 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2287 transitions. Word has length 158 [2022-11-16 12:19:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:07,370 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2287 transitions. [2022-11-16 12:19:07,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.6) internal successors, (172), 18 states have internal predecessors, (172), 13 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (42), 11 states have call predecessors, (42), 12 states have call successors, (42) [2022-11-16 12:19:07,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2287 transitions. [2022-11-16 12:19:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-16 12:19:07,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:07,375 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-11-16 12:19:07,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:07,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 12:19:07,599 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:07,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1453577679, now seen corresponding path program 1 times [2022-11-16 12:19:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:07,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145597702] [2022-11-16 12:19:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:07,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:07,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:07,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:08,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-16 12:19:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-16 12:19:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-16 12:19:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:08,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145597702] [2022-11-16 12:19:08,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145597702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:08,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:08,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 12:19:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224482523] [2022-11-16 12:19:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:08,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 12:19:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 12:19:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:19:08,252 INFO L87 Difference]: Start difference. First operand 1733 states and 2287 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 12:19:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:11,533 INFO L93 Difference]: Finished difference Result 3140 states and 4164 transitions. [2022-11-16 12:19:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:19:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 168 [2022-11-16 12:19:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:11,542 INFO L225 Difference]: With dead ends: 3140 [2022-11-16 12:19:11,543 INFO L226 Difference]: Without dead ends: 1733 [2022-11-16 12:19:11,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-16 12:19:11,549 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 345 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:11,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 3136 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-16 12:19:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-11-16 12:19:11,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1731. [2022-11-16 12:19:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1225 states have (on average 1.220408163265306) internal successors, (1495), 1255 states have internal predecessors, (1495), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 370 states have call predecessors, (411), 376 states have call successors, (411) [2022-11-16 12:19:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2284 transitions. [2022-11-16 12:19:11,657 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2284 transitions. Word has length 168 [2022-11-16 12:19:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:11,658 INFO L495 AbstractCegarLoop]: Abstraction has 1731 states and 2284 transitions. [2022-11-16 12:19:11,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 12:19:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2284 transitions. [2022-11-16 12:19:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-16 12:19:11,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:11,662 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 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-16 12:19:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:19:11,663 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash 496722576, now seen corresponding path program 2 times [2022-11-16 12:19:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920556330] [2022-11-16 12:19:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-16 12:19:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-16 12:19:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-16 12:19:12,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:12,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920556330] [2022-11-16 12:19:12,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920556330] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:12,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93192349] [2022-11-16 12:19:12,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:19:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:12,419 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:12,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:19:13,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:19:13,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:19:13,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:19:13,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-16 12:19:13,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-16 12:19:14,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93192349] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:19:14,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:19:14,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 15] total 26 [2022-11-16 12:19:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955802920] [2022-11-16 12:19:14,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:19:14,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 12:19:14,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:14,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 12:19:14,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2022-11-16 12:19:14,431 INFO L87 Difference]: Start difference. First operand 1731 states and 2284 transitions. Second operand has 26 states, 25 states have (on average 7.72) internal successors, (193), 22 states have internal predecessors, (193), 13 states have call successors, (49), 13 states have call predecessors, (49), 11 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-11-16 12:19:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:30,175 INFO L93 Difference]: Finished difference Result 3288 states and 4334 transitions. [2022-11-16 12:19:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 12:19:30,175 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 7.72) internal successors, (193), 22 states have internal predecessors, (193), 13 states have call successors, (49), 13 states have call predecessors, (49), 11 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 168 [2022-11-16 12:19:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:30,192 INFO L225 Difference]: With dead ends: 3288 [2022-11-16 12:19:30,192 INFO L226 Difference]: Without dead ends: 3180 [2022-11-16 12:19:30,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 359 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=888, Invalid=3018, Unknown=0, NotChecked=0, Total=3906 [2022-11-16 12:19:30,196 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 5946 mSDsluCounter, 4884 mSDsCounter, 0 mSdLazyCounter, 8299 mSolverCounterSat, 3471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6215 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 11770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3471 IncrementalHoareTripleChecker+Valid, 8299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:30,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6215 Valid, 5528 Invalid, 11770 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3471 Valid, 8299 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2022-11-16 12:19:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-11-16 12:19:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3112. [2022-11-16 12:19:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2199 states have (on average 1.2223738062755798) internal successors, (2688), 2255 states have internal predecessors, (2688), 687 states have call successors, (687), 217 states have call predecessors, (687), 225 states have return successors, (755), 673 states have call predecessors, (755), 685 states have call successors, (755) [2022-11-16 12:19:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4130 transitions. [2022-11-16 12:19:30,392 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4130 transitions. Word has length 168 [2022-11-16 12:19:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:30,393 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4130 transitions. [2022-11-16 12:19:30,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.72) internal successors, (193), 22 states have internal predecessors, (193), 13 states have call successors, (49), 13 states have call predecessors, (49), 11 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-11-16 12:19:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4130 transitions. [2022-11-16 12:19:30,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-16 12:19:30,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:30,398 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-11-16 12:19:30,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:30,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:30,608 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:30,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash -645774525, now seen corresponding path program 1 times [2022-11-16 12:19:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20591144] [2022-11-16 12:19:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:19:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-16 12:19:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-16 12:19:31,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20591144] [2022-11-16 12:19:31,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20591144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559323252] [2022-11-16 12:19:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:31,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:31,780 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:31,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:19:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:32,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-16 12:19:32,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:32,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:19:32,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:19:32,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:19:32,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:19:33,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-11-16 12:19:33,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:19:33,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-11-16 12:19:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-16 12:19:33,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-16 12:19:33,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559323252] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:19:33,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:19:33,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-11-16 12:19:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331265998] [2022-11-16 12:19:33,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:19:33,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 12:19:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:33,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 12:19:33,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-11-16 12:19:33,571 INFO L87 Difference]: Start difference. First operand 3112 states and 4130 transitions. Second operand has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-11-16 12:19:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:37,819 INFO L93 Difference]: Finished difference Result 4952 states and 6543 transitions. [2022-11-16 12:19:37,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 12:19:37,820 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 169 [2022-11-16 12:19:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:37,832 INFO L225 Difference]: With dead ends: 4952 [2022-11-16 12:19:37,832 INFO L226 Difference]: Without dead ends: 2107 [2022-11-16 12:19:37,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 367 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:19:37,841 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 348 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:37,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 3891 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2261 Invalid, 0 Unknown, 383 Unchecked, 4.0s Time] [2022-11-16 12:19:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2022-11-16 12:19:37,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2096. [2022-11-16 12:19:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1482 states have (on average 1.2179487179487178) internal successors, (1805), 1519 states have internal predecessors, (1805), 452 states have call successors, (452), 156 states have call predecessors, (452), 161 states have return successors, (488), 443 states have call predecessors, (488), 450 states have call successors, (488) [2022-11-16 12:19:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2745 transitions. [2022-11-16 12:19:37,974 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2745 transitions. Word has length 169 [2022-11-16 12:19:37,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:37,975 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2745 transitions. [2022-11-16 12:19:37,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-11-16 12:19:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2745 transitions. [2022-11-16 12:19:37,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-16 12:19:37,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:37,979 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:37,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:38,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 12:19:38,189 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:38,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:38,190 INFO L85 PathProgramCache]: Analyzing trace with hash -761850914, now seen corresponding path program 1 times [2022-11-16 12:19:38,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:38,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728589890] [2022-11-16 12:19:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:19:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-16 12:19:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-16 12:19:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-16 12:19:38,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:38,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728589890] [2022-11-16 12:19:38,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728589890] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:38,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176673678] [2022-11-16 12:19:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:38,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:38,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:38,991 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:38,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 12:19:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:39,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:19:39,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:40,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:19:40,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:19:40,136 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-16 12:19:40,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:19:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-16 12:19:40,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176673678] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:40,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:19:40,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-11-16 12:19:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362208344] [2022-11-16 12:19:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:19:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:19:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:19:40,326 INFO L87 Difference]: Start difference. First operand 2096 states and 2745 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:19:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:41,319 INFO L93 Difference]: Finished difference Result 2162 states and 2804 transitions. [2022-11-16 12:19:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:19:41,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 179 [2022-11-16 12:19:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:41,329 INFO L225 Difference]: With dead ends: 2162 [2022-11-16 12:19:41,329 INFO L226 Difference]: Without dead ends: 2067 [2022-11-16 12:19:41,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 392 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-16 12:19:41,331 INFO L413 NwaCegarLoop]: 685 mSDtfsCounter, 8 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3279 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:41,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3279 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-16 12:19:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-11-16 12:19:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2067. [2022-11-16 12:19:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1467 states have (on average 1.2194955691888207) internal successors, (1789), 1504 states have internal predecessors, (1789), 438 states have call successors, (438), 156 states have call predecessors, (438), 161 states have return successors, (464), 429 states have call predecessors, (464), 436 states have call successors, (464) [2022-11-16 12:19:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2691 transitions. [2022-11-16 12:19:41,455 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2691 transitions. Word has length 179 [2022-11-16 12:19:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:41,456 INFO L495 AbstractCegarLoop]: Abstraction has 2067 states and 2691 transitions. [2022-11-16 12:19:41,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 12:19:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2691 transitions. [2022-11-16 12:19:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-16 12:19:41,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:41,459 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:41,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:41,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 12:19:41,669 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 16369044, now seen corresponding path program 1 times [2022-11-16 12:19:41,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:41,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663138296] [2022-11-16 12:19:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:41,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:19:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:19:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:19:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:19:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:19:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:19:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:19:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 12:19:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-16 12:19:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 12:19:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 12:19:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-16 12:19:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-11-16 12:19:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:43,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663138296] [2022-11-16 12:19:43,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663138296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:43,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:43,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 12:19:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051558975] [2022-11-16 12:19:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:43,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 12:19:43,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 12:19:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:19:43,163 INFO L87 Difference]: Start difference. First operand 2067 states and 2691 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-16 12:19:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:47,612 INFO L93 Difference]: Finished difference Result 3853 states and 5056 transitions. [2022-11-16 12:19:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 12:19:47,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 254 [2022-11-16 12:19:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:47,623 INFO L225 Difference]: With dead ends: 3853 [2022-11-16 12:19:47,623 INFO L226 Difference]: Without dead ends: 2100 [2022-11-16 12:19:47,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:19:47,629 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 303 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:47,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 2645 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-16 12:19:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-11-16 12:19:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2060. [2022-11-16 12:19:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.2202462380300958) internal successors, (1784), 1499 states have internal predecessors, (1784), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-16 12:19:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2683 transitions. [2022-11-16 12:19:47,819 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2683 transitions. Word has length 254 [2022-11-16 12:19:47,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:47,820 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 2683 transitions. [2022-11-16 12:19:47,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-16 12:19:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2683 transitions. [2022-11-16 12:19:47,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-16 12:19:47,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:47,824 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:47,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:19:47,824 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash 664622260, now seen corresponding path program 1 times [2022-11-16 12:19:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:47,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42600517] [2022-11-16 12:19:47,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:47,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:19:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:19:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:19:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:19:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:19:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:19:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:19:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 12:19:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-16 12:19:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 12:19:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 12:19:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-16 12:19:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-16 12:19:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:48,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42600517] [2022-11-16 12:19:48,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42600517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:48,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:48,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:19:48,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113150962] [2022-11-16 12:19:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:48,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:19:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:48,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:19:48,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:19:48,457 INFO L87 Difference]: Start difference. First operand 2060 states and 2683 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-16 12:19:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:51,605 INFO L93 Difference]: Finished difference Result 2120 states and 2782 transitions. [2022-11-16 12:19:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:19:51,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 254 [2022-11-16 12:19:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:51,615 INFO L225 Difference]: With dead ends: 2120 [2022-11-16 12:19:51,616 INFO L226 Difference]: Without dead ends: 2110 [2022-11-16 12:19:51,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:19:51,618 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 1003 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:51,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2184 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-16 12:19:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-11-16 12:19:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2060. [2022-11-16 12:19:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.219562243502052) internal successors, (1783), 1499 states have internal predecessors, (1783), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-16 12:19:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2682 transitions. [2022-11-16 12:19:51,762 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2682 transitions. Word has length 254 [2022-11-16 12:19:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:51,763 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 2682 transitions. [2022-11-16 12:19:51,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-16 12:19:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2682 transitions. [2022-11-16 12:19:51,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-16 12:19:51,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:51,767 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:19:51,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:19:51,767 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:51,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1704405801, now seen corresponding path program 1 times [2022-11-16 12:19:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:51,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338031486] [2022-11-16 12:19:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:19:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:19:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:19:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:19:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:19:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:19:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:19:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 12:19:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-16 12:19:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 12:19:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 12:19:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-16 12:19:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-16 12:19:52,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338031486] [2022-11-16 12:19:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338031486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467971563] [2022-11-16 12:19:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:52,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:52,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:52,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 12:19:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:53,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:19:53,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-16 12:19:53,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:19:53,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467971563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:53,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:19:53,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-11-16 12:19:53,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453030736] [2022-11-16 12:19:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:53,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:19:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:53,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:19:53,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:19:53,850 INFO L87 Difference]: Start difference. First operand 2060 states and 2682 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-16 12:19:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:54,172 INFO L93 Difference]: Finished difference Result 3798 states and 4957 transitions. [2022-11-16 12:19:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:19:54,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 259 [2022-11-16 12:19:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:54,182 INFO L225 Difference]: With dead ends: 3798 [2022-11-16 12:19:54,182 INFO L226 Difference]: Without dead ends: 2064 [2022-11-16 12:19:54,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:19:54,188 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 357 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:54,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1842 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:19:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-11-16 12:19:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 2060. [2022-11-16 12:19:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.2181942544459645) internal successors, (1781), 1499 states have internal predecessors, (1781), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-16 12:19:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2680 transitions. [2022-11-16 12:19:54,331 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2680 transitions. Word has length 259 [2022-11-16 12:19:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:54,332 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 2680 transitions. [2022-11-16 12:19:54,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-16 12:19:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2680 transitions. [2022-11-16 12:19:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-16 12:19:54,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:54,336 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-16 12:19:54,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:54,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:54,549 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:54,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1922177855, now seen corresponding path program 1 times [2022-11-16 12:19:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:54,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523587444] [2022-11-16 12:19:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:19:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:19:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:19:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:19:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:19:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:19:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:19:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:19:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:19:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:19:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:19:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:19:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:19:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:19:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:19:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:19:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:19:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:19:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:19:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 12:19:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-16 12:19:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 12:19:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 12:19:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-16 12:19:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-16 12:19:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-16 12:19:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-11-16 12:19:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-11-16 12:19:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523587444] [2022-11-16 12:19:55,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523587444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:19:55,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942184488] [2022-11-16 12:19:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:55,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:55,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:19:55,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:19:55,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 12:19:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:56,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 3165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:19:56,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:19:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-16 12:19:56,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:19:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942184488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:56,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:19:56,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-16 12:19:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844852407] [2022-11-16 12:19:56,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:56,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:19:56,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:56,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:19:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:19:56,851 INFO L87 Difference]: Start difference. First operand 2060 states and 2680 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-16 12:19:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:57,177 INFO L93 Difference]: Finished difference Result 3802 states and 4975 transitions. [2022-11-16 12:19:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:19:57,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 279 [2022-11-16 12:19:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:57,188 INFO L225 Difference]: With dead ends: 3802 [2022-11-16 12:19:57,188 INFO L226 Difference]: Without dead ends: 2068 [2022-11-16 12:19:57,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:19:57,194 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 29 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:57,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1906 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:19:57,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-11-16 12:19:57,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2022-11-16 12:19:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1469 states have (on average 1.2178352620830497) internal successors, (1789), 1506 states have internal predecessors, (1789), 438 states have call successors, (438), 157 states have call predecessors, (438), 160 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-16 12:19:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2688 transitions. [2022-11-16 12:19:57,388 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2688 transitions. Word has length 279 [2022-11-16 12:19:57,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:57,389 INFO L495 AbstractCegarLoop]: Abstraction has 2068 states and 2688 transitions. [2022-11-16 12:19:57,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-16 12:19:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2688 transitions. [2022-11-16 12:19:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-16 12:19:57,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:57,395 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:19:57,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:19:57,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:19:57,613 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:19:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1296304718, now seen corresponding path program 1 times [2022-11-16 12:19:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:57,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440781848] [2022-11-16 12:19:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:20:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:20:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:20:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:20:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:20:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:20:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:20:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:20:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:20:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:20:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:20:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:20:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:20:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:20:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:20:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:20:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:20:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:20:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:20:10,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:20:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:20:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:20:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:11,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-16 12:20:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-16 12:20:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 12:20:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 12:20:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-16 12:20:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-16 12:20:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-16 12:20:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-11-16 12:20:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-16 12:20:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:12,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440781848] [2022-11-16 12:20:12,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440781848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:20:12,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034110736] [2022-11-16 12:20:12,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:12,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:20:12,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:20:12,255 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:20:12,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 12:20:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:13,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 3163 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-16 12:20:13,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:20:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-16 12:20:15,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:20:17,430 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-16 12:20:17,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2022-11-16 12:20:17,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 74 [2022-11-16 12:20:17,703 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:20:17,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:20:17,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:20:17,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-16 12:20:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 23 proven. 30 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-16 12:20:17,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034110736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:20:17,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:20:17,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 17, 15] total 81 [2022-11-16 12:20:17,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920648195] [2022-11-16 12:20:17,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:20:17,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-16 12:20:17,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:17,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-16 12:20:17,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=6216, Unknown=0, NotChecked=0, Total=6480 [2022-11-16 12:20:17,830 INFO L87 Difference]: Start difference. First operand 2068 states and 2688 transitions. Second operand has 81 states, 71 states have (on average 3.859154929577465) internal successors, (274), 59 states have internal predecessors, (274), 22 states have call successors, (63), 6 states have call predecessors, (63), 24 states have return successors, (69), 27 states have call predecessors, (69), 22 states have call successors, (69) [2022-11-16 12:21:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:20,571 INFO L93 Difference]: Finished difference Result 4979 states and 6819 transitions. [2022-11-16 12:21:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 12:21:20,571 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 71 states have (on average 3.859154929577465) internal successors, (274), 59 states have internal predecessors, (274), 22 states have call successors, (63), 6 states have call predecessors, (63), 24 states have return successors, (69), 27 states have call predecessors, (69), 22 states have call successors, (69) Word has length 279 [2022-11-16 12:21:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:20,585 INFO L225 Difference]: With dead ends: 4979 [2022-11-16 12:21:20,585 INFO L226 Difference]: Without dead ends: 3237 [2022-11-16 12:21:20,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1224, Invalid=18798, Unknown=0, NotChecked=0, Total=20022 [2022-11-16 12:21:20,596 INFO L413 NwaCegarLoop]: 667 mSDtfsCounter, 1815 mSDsluCounter, 22913 mSDsCounter, 0 mSdLazyCounter, 30745 mSolverCounterSat, 1218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 23580 SdHoareTripleChecker+Invalid, 35088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1218 IncrementalHoareTripleChecker+Valid, 30745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3125 IncrementalHoareTripleChecker+Unchecked, 56.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:20,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 23580 Invalid, 35088 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1218 Valid, 30745 Invalid, 0 Unknown, 3125 Unchecked, 56.1s Time] [2022-11-16 12:21:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2022-11-16 12:21:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 2178. [2022-11-16 12:21:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1549 states have (on average 1.2149774047772757) internal successors, (1882), 1587 states have internal predecessors, (1882), 462 states have call successors, (462), 162 states have call predecessors, (462), 166 states have return successors, (524), 451 states have call predecessors, (524), 460 states have call successors, (524) [2022-11-16 12:21:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 2868 transitions. [2022-11-16 12:21:20,818 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 2868 transitions. Word has length 279 [2022-11-16 12:21:20,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:20,818 INFO L495 AbstractCegarLoop]: Abstraction has 2178 states and 2868 transitions. [2022-11-16 12:21:20,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 71 states have (on average 3.859154929577465) internal successors, (274), 59 states have internal predecessors, (274), 22 states have call successors, (63), 6 states have call predecessors, (63), 24 states have return successors, (69), 27 states have call predecessors, (69), 22 states have call successors, (69) [2022-11-16 12:21:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2868 transitions. [2022-11-16 12:21:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-11-16 12:21:20,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:20,824 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:20,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 12:21:21,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:21,036 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:21:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2001105311, now seen corresponding path program 1 times [2022-11-16 12:21:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:21,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175866250] [2022-11-16 12:21:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:21,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:21:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:21:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:21:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:21:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:21:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:21:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:21:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:21:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:21:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:21:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:21:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:21:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:21:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:21:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:21:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:21:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:21:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:21:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:21:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:21:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:21:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:21:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:37,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-16 12:21:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:38,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 12:21:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-16 12:21:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-16 12:21:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-16 12:21:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-16 12:21:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-16 12:21:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-16 12:21:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 48 proven. 61 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-16 12:21:39,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:39,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175866250] [2022-11-16 12:21:39,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175866250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:21:39,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340076441] [2022-11-16 12:21:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:39,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:21:39,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:21:39,271 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:21:39,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 12:21:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:40,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 12:21:40,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:22:04,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2022-11-16 12:22:04,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2022-11-16 12:22:04,326 INFO L321 Elim1Store]: treesize reduction 106, result has 36.9 percent of original size [2022-11-16 12:22:04,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 88 [2022-11-16 12:22:07,228 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 64 proven. 14 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-16 12:22:07,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:22:08,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 111 [2022-11-16 12:22:08,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 69 [2022-11-16 12:22:08,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2022-11-16 12:22:09,579 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-16 12:22:09,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 50 [2022-11-16 12:22:10,279 INFO L321 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2022-11-16 12:22:10,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 327 treesize of output 1 [2022-11-16 12:22:10,299 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:22:10,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 57 [2022-11-16 12:22:10,312 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 12:22:10,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2022-11-16 12:22:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-16 12:22:10,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340076441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:22:10,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:22:10,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21, 16] total 88 [2022-11-16 12:22:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798111571] [2022-11-16 12:22:10,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:22:10,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-16 12:22:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:10,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-16 12:22:10,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=7330, Unknown=11, NotChecked=0, Total=7656 [2022-11-16 12:22:10,444 INFO L87 Difference]: Start difference. First operand 2178 states and 2868 transitions. Second operand has 88 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 64 states have internal predecessors, (283), 25 states have call successors, (65), 7 states have call predecessors, (65), 25 states have return successors, (71), 29 states have call predecessors, (71), 25 states have call successors, (71) [2022-11-16 12:23:18,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:18,324 INFO L93 Difference]: Finished difference Result 4290 states and 5779 transitions. [2022-11-16 12:23:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-16 12:23:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 64 states have internal predecessors, (283), 25 states have call successors, (65), 7 states have call predecessors, (65), 25 states have return successors, (71), 29 states have call predecessors, (71), 25 states have call successors, (71) Word has length 280 [2022-11-16 12:23:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:18,338 INFO L225 Difference]: With dead ends: 4290 [2022-11-16 12:23:18,338 INFO L226 Difference]: Without dead ends: 2432 [2022-11-16 12:23:18,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 622 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 55.2s TimeCoverageRelationStatistics Valid=1404, Invalid=22431, Unknown=35, NotChecked=0, Total=23870 [2022-11-16 12:23:18,349 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 1798 mSDsluCounter, 20425 mSDsCounter, 0 mSdLazyCounter, 21560 mSolverCounterSat, 1352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 21072 SdHoareTripleChecker+Invalid, 25654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1352 IncrementalHoareTripleChecker+Valid, 21560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2742 IncrementalHoareTripleChecker+Unchecked, 43.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:18,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 21072 Invalid, 25654 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1352 Valid, 21560 Invalid, 0 Unknown, 2742 Unchecked, 43.0s Time] [2022-11-16 12:23:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2022-11-16 12:23:18,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2293. [2022-11-16 12:23:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1630 states have (on average 1.2116564417177915) internal successors, (1975), 1672 states have internal predecessors, (1975), 487 states have call successors, (487), 167 states have call predecessors, (487), 175 states have return successors, (632), 476 states have call predecessors, (632), 485 states have call successors, (632) [2022-11-16 12:23:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3094 transitions. [2022-11-16 12:23:18,690 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3094 transitions. Word has length 280 [2022-11-16 12:23:18,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:18,691 INFO L495 AbstractCegarLoop]: Abstraction has 2293 states and 3094 transitions. [2022-11-16 12:23:18,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 64 states have internal predecessors, (283), 25 states have call successors, (65), 7 states have call predecessors, (65), 25 states have return successors, (71), 29 states have call predecessors, (71), 25 states have call successors, (71) [2022-11-16 12:23:18,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3094 transitions. [2022-11-16 12:23:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-11-16 12:23:18,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:18,697 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:23:18,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:23:18,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 12:23:18,910 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:23:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1321440547, now seen corresponding path program 1 times [2022-11-16 12:23:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:18,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867950976] [2022-11-16 12:23:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 12:23:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-16 12:23:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:23:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:23:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:23:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-16 12:23:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-16 12:23:33,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-16 12:23:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:23:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:23:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:23:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-16 12:23:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:23:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:23:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-16 12:23:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-16 12:23:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-16 12:23:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-16 12:23:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 12:23:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:35,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 12:23:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-16 12:23:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 12:23:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-16 12:23:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 12:23:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-16 12:23:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-16 12:23:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-16 12:23:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-16 12:23:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-16 12:23:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-16 12:23:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-16 12:23:36,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:36,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867950976] [2022-11-16 12:23:36,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867950976] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:23:36,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881885389] [2022-11-16 12:23:36,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:36,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:23:36,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:23:36,857 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:23:36,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 12:23:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:38,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-16 12:23:38,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:51,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2022-11-16 12:23:51,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2022-11-16 12:23:51,509 INFO L321 Elim1Store]: treesize reduction 106, result has 36.9 percent of original size [2022-11-16 12:23:51,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 93 [2022-11-16 12:23:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 52 proven. 26 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-16 12:23:55,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:23:57,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 87 [2022-11-16 12:23:57,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 51 [2022-11-16 12:23:57,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-16 12:23:58,345 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-16 12:23:58,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2022-11-16 12:23:59,005 INFO L321 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2022-11-16 12:23:59,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 1 [2022-11-16 12:23:59,022 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-16 12:23:59,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 57 [2022-11-16 12:23:59,034 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-16 12:23:59,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2022-11-16 12:23:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-16 12:23:59,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881885389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:23:59,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 12:23:59,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 20, 17] total 84 [2022-11-16 12:23:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783217523] [2022-11-16 12:23:59,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 12:23:59,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-16 12:23:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:59,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-16 12:23:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=6664, Unknown=6, NotChecked=0, Total=6972 [2022-11-16 12:23:59,155 INFO L87 Difference]: Start difference. First operand 2293 states and 3094 transitions. Second operand has 84 states, 73 states have (on average 3.780821917808219) internal successors, (276), 62 states have internal predecessors, (276), 25 states have call successors, (63), 7 states have call predecessors, (63), 23 states have return successors, (68), 28 states have call predecessors, (68), 25 states have call successors, (68) [2022-11-16 12:25:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:25:22,469 INFO L93 Difference]: Finished difference Result 5359 states and 7506 transitions. [2022-11-16 12:25:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-16 12:25:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 73 states have (on average 3.780821917808219) internal successors, (276), 62 states have internal predecessors, (276), 25 states have call successors, (63), 7 states have call predecessors, (63), 23 states have return successors, (68), 28 states have call predecessors, (68), 25 states have call successors, (68) Word has length 280 [2022-11-16 12:25:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:25:22,485 INFO L225 Difference]: With dead ends: 5359 [2022-11-16 12:25:22,485 INFO L226 Difference]: Without dead ends: 3383 [2022-11-16 12:25:22,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 624 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4212 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=1246, Invalid=18763, Unknown=13, NotChecked=0, Total=20022 [2022-11-16 12:25:22,496 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1547 mSDsluCounter, 24533 mSDsCounter, 0 mSdLazyCounter, 26759 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 25327 SdHoareTripleChecker+Invalid, 30677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 26759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2904 IncrementalHoareTripleChecker+Unchecked, 57.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:25:22,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 25327 Invalid, 30677 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1014 Valid, 26759 Invalid, 0 Unknown, 2904 Unchecked, 57.6s Time] [2022-11-16 12:25:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2022-11-16 12:25:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2304. [2022-11-16 12:25:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1645 states have (on average 1.2103343465045593) internal successors, (1991), 1685 states have internal predecessors, (1991), 480 states have call successors, (480), 172 states have call predecessors, (480), 178 states have return successors, (578), 469 states have call predecessors, (578), 478 states have call successors, (578) [2022-11-16 12:25:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3049 transitions. [2022-11-16 12:25:22,759 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3049 transitions. Word has length 280 [2022-11-16 12:25:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:25:22,760 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3049 transitions. [2022-11-16 12:25:22,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 73 states have (on average 3.780821917808219) internal successors, (276), 62 states have internal predecessors, (276), 25 states have call successors, (63), 7 states have call predecessors, (63), 23 states have return successors, (68), 28 states have call predecessors, (68), 25 states have call successors, (68) [2022-11-16 12:25:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3049 transitions. [2022-11-16 12:25:22,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-11-16 12:25:22,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:25:22,767 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:22,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 12:25:22,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:25:22,982 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:25:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:25:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1289811898, now seen corresponding path program 1 times [2022-11-16 12:25:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:25:22,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703940767] [2022-11-16 12:25:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:25:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:25:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:26,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:25:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:25:30,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:25:30,040 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:25:30,042 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 12:25:30,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 12:25:30,048 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:25:30,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:25:30,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:25:30 BoogieIcfgContainer [2022-11-16 12:25:30,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:25:30,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:25:30,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:25:30,418 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:25:30,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:18:08" (3/4) ... [2022-11-16 12:25:30,422 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:25:30,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:25:30,423 INFO L158 Benchmark]: Toolchain (without parser) took 447689.19ms. Allocated memory was 138.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 96.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 539.0MB. Max. memory is 16.1GB. [2022-11-16 12:25:30,423 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 90.2MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 26.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:30,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2313.74ms. Allocated memory was 138.4MB in the beginning and 234.9MB in the end (delta: 96.5MB). Free memory was 96.3MB in the beginning and 157.2MB in the end (delta: -60.9MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2022-11-16 12:25:30,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 199.10ms. Allocated memory is still 234.9MB. Free memory was 156.1MB in the beginning and 144.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:25:30,424 INFO L158 Benchmark]: Boogie Preprocessor took 214.03ms. Allocated memory is still 234.9MB. Free memory was 144.6MB in the beginning and 132.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 12:25:30,425 INFO L158 Benchmark]: RCFGBuilder took 2910.60ms. Allocated memory is still 234.9MB. Free memory was 132.0MB in the beginning and 142.7MB in the end (delta: -10.7MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2022-11-16 12:25:30,425 INFO L158 Benchmark]: TraceAbstraction took 442039.02ms. Allocated memory was 234.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 141.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-16 12:25:30,425 INFO L158 Benchmark]: Witness Printer took 5.12ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:25:30,429 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.25ms. Allocated memory is still 90.2MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 26.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2313.74ms. Allocated memory was 138.4MB in the beginning and 234.9MB in the end (delta: 96.5MB). Free memory was 96.3MB in the beginning and 157.2MB in the end (delta: -60.9MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 199.10ms. Allocated memory is still 234.9MB. Free memory was 156.1MB in the beginning and 144.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 214.03ms. Allocated memory is still 234.9MB. Free memory was 144.6MB in the beginning and 132.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2910.60ms. Allocated memory is still 234.9MB. Free memory was 132.0MB in the beginning and 142.7MB in the end (delta: -10.7MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * TraceAbstraction took 442039.02ms. Allocated memory was 234.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 141.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 5.12ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. 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 - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L6764] static int res_catc_open_15 ; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6271] static struct lock_class_key __key___10 ; [L6270] static struct lock_class_key __key___9 ; [L6763] int LDV_IN_INTERRUPT ; [L6766] static int res_catc_probe_17 ; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L6960] int ldv_coherent_state = 0; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6765] static int res_catc_stop_16 ; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6272] static struct lock_class_key __key___11 ; [L6959] int ldv_urb_state = 0; [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 [L6783] FCALL ldv_initialize() [L6784] CALL, EXPR catc_init() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L6718] CALL, EXPR usb_register(& catc_driver) [L5088] int tmp___7 ; [L5091] CALL, EXPR usb_register_driver(driver, & __this_module, "catc") [L7209] return __VERIFIER_nondet_int(); [L5091] RET, EXPR usb_register_driver(driver, & __this_module, "catc") [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [\result=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver={30:0}, driver={30:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6718] RET, EXPR usb_register(& catc_driver) [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [\result=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6784] RET, EXPR catc_init() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_init()=0, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6793] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___9=-2] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6897] CALL, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L6291] CALL, EXPR interface_to_usbdev(intf) [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [\result={-7:172}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __mptr={-7:303}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] RET, EXPR interface_to_usbdev(intf) [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L6293-L6294] CALL, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] RET, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L6304] CALL, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L7117] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(size)=2416, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=70119, \old(arg1)=1, \old(arg2)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arg0=70119, arg1=1, arg2=1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={33:0}, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] RET, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, usbdev={-7:172}] [L6311] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={33:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={33:126}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={33:0}, dev={33:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, netdev_priv((struct net_device const *)netdev)={33:126}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, usbdev={-7:172}] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6320] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6323] CALL spinlock_check(& catc->tx_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:166}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:166}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:166}, lock={33:166}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6323] RET spinlock_check(& catc->tx_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->tx_lock)={33:166}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6326] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6329-L6330] FCALL __raw_spin_lock_init(& catc->tx_lock.__annonCompField18.rlock, "&(&catc->tx_lock)->rlock", & __key___9) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6343] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6346] CALL spinlock_check(& catc->ctrl_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:230}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:230}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:230}, lock={33:230}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6346] RET spinlock_check(& catc->ctrl_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->ctrl_lock)={33:230}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6349] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6352-L6353] FCALL __raw_spin_lock_init(& catc->ctrl_lock.__annonCompField18.rlock, "&(&catc->ctrl_lock)->rlock", & __key___10) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6366] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6369] FCALL init_timer_key(& catc->timer, "&catc->timer", & __key___11) [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6379] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-4:0}, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-4:0}, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-4:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-4:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \result={-4:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-4:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-4:0}] [L6379] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-4:0}, usbdev={-7:172}] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L6380] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-6:0}, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-6:0}, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, \result={-6:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L6380] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-6:0}, usbdev={-7:172}] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L6381] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=2, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-7:0}, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-7:0}, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, \result={-7:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:0}] [L6381] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-7:0}, usbdev={-7:172}] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L6382] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=3, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-8:0}, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-8:0}, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-8:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, \result={-8:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-8:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L6382] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-8:0}, usbdev={-7:172}] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->ctrl_urb={-4:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->tx_urb={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->rx_urb={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->irq_urb={-8:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}, usbdev->descriptor.idVendor=70] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6432] CALL, EXPR __create_pipe(usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] RET, EXPR __create_pipe(usbdev, 0U) VAL [__create_pipe(usbdev, 0U)=33024, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] EXPR catc->ctrl_urb [L6433-L6435] CALL usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=0, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:13}, complete_fn={-1:13}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=2147483648, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, setup_packet={0:0}, setup_packet={0:0}, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-4:0}, urb={-4:0}] [L6433-L6435] RET usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L6436] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] EXPR catc->tx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->tx_urb={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6437-L6438] CALL usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [\old(buffer_length)=0, \old(pipe)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:14}, context={33:126}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, urb={-6:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=0, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:14}, complete_fn={-1:14}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=32768, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-6:0}, urb={-6:0}] [L6437-L6438] RET usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->tx_urb={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6439] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] EXPR catc->rx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->rx_urb={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6440-L6441] CALL usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [\old(buffer_length)=23070, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:15}, context={33:126}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46434}, urb={-7:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=23070, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=23070, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:15}, complete_fn={-1:15}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46434}, transfer_buffer={33:46434}, urb={-7:0}, urb={-7:0}] [L6440-L6441] RET usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->rx_urb={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6442] CALL, EXPR __create_pipe(usbdev, 2U) VAL [\old(endpoint)=2, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] RET, EXPR __create_pipe(usbdev, 2U) VAL [__create_pipe(usbdev, 2U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] EXPR catc->irq_urb [L6443-L6444] CALL usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=2, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, dev->speed=4294967299, driver_name={29:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69504}, transfer_buffer={33:69504}, urb={-8:0}, urb={-8:0}] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=2, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69504}, transfer_buffer={33:69504}, urb={-8:0}, urb={-8:0}] [L5148] urb->start_frame = -1 VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=2, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69504}, transfer_buffer={33:69504}, urb={-8:0}, urb={-8:0}] [L6443-L6444] RET usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L6446] EXPR catc->is_f5u011 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->is_f5u011=74, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6607] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, \result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L6607] RET catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0)=-1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6608] EXPR netdev->dev_addr VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551678:18446744073709551670}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6608-L6609] CALL catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5686] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=2147483648, tmp___9=2147483649, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___7=2147483648, tmp___9=2147483649, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=2147483648, tmp___9=2147483649, value=0] [L5705] return (tmp___11); VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, \result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=2147483648, tmp___9=2147483649, value=0] [L6608-L6609] RET catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6)=-1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551678:18446744073709551670}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6612] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6622-L6623] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, \result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L6622-L6623] RET catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2)=-1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6627] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6634] catc->is_f5u011 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->is_f5u011=74, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___14={21:0}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L6642] CALL usb_set_intfdata(intf, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5059] CALL dev_set_drvdata(& intf->dev, data) [L7138] return __VERIFIER_nondet_int(); [L5059] RET dev_set_drvdata(& intf->dev, data) [L6642] RET usb_set_intfdata(intf, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___14={21:0}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6643] netdev->dev.parent = & intf->dev [L6644] CALL, EXPR register_netdev(netdev) [L7187] return __VERIFIER_nondet_int(); [L6644] RET, EXPR register_netdev(netdev) [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [\result=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___14={21:0}, tmp___15=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6897] RET, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6898] FCALL ldv_check_return_value(res_catc_probe_17) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6793] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6854] CALL, EXPR catc_open(var_group1) [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={18446744073709551671:75}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={18446744073709551671:86}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={18446744073709551671:75}, dev={18446744073709551671:75}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, netdev_priv((struct net_device const *)netdev)={18446744073709551671:86}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={18446744073709551671:86}, catc->irq_urb={18446744073709551665:73}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551671:86}] [L6186] CALL, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [\old(arg1)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arg0={18446744073709551665:73}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7217] return __VERIFIER_nondet_int(); [L6186] RET, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={18446744073709551671:86}, catc->irq_urb={18446744073709551665:73}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551671:86}, usb_submit_urb(catc->irq_urb, 208U)=-1] [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [\result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={18446744073709551671:86}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, status=-1, tmp___7={18446744073709551671:86}] [L6854] RET, EXPR catc_open(var_group1) [L6854] res_catc_open_15 = catc_open(var_group1) [L6855] FCALL ldv_check_return_value(res_catc_open_15) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group1={18446744073709551671:75}, var_group5={18446744073709551630:57}] [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group1={18446744073709551671:75}, var_group5={18446744073709551630:57}] [L6934] CALL catc_exit() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6736] FCALL usb_deregister(& catc_driver) [L6934] RET catc_exit() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group1={18446744073709551671:75}, var_group5={18446744073709551630:57}] [L6938] CALL ldv_check_final_state() [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7084] CALL ldv_blast_assert() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6946] reach_error() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 544 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 441.6s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 283.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25921 SdHoareTripleChecker+Valid, 220.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24548 mSDsluCounter, 131483 SdHoareTripleChecker+Invalid, 204.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10798 IncrementalHoareTripleChecker+Unchecked, 116429 mSDsCounter, 12960 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110823 IncrementalHoareTripleChecker+Invalid, 134581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12960 mSolverCounterUnsat, 15054 mSDtfsCounter, 110823 mSolverCounterSat, 1.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6685 GetRequests, 5905 SyntacticMatches, 56 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15794 ImplicationChecksByTransitivity, 116.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3112occurred in iteration=14, InterpolantAutomatonStates: 441, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 2623 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 15.6s SatisfiabilityAnalysisTime, 122.0s InterpolantComputationTime, 7036 NumberOfCodeBlocks, 7036 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 8829 ConstructedInterpolants, 220 QuantifiedInterpolants, 42985 SizeOfPredicates, 134 NumberOfNonLiveVariables, 35051 ConjunctsInSsa, 606 ConjunctsInUnsatCore, 49 InterpolantComputations, 14 PerfectInterpolantSequences, 6185/6808 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 12:25:30,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8 --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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- 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-e04fb08 [2022-11-16 12:25:33,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:25:33,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:25:33,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:25:33,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:25:33,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:25:33,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:25:33,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:25:33,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:25:33,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:25:33,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:25:33,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:25:33,190 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:25:33,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:25:33,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:25:33,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:25:33,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:25:33,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:25:33,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:25:33,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:25:33,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:25:33,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:25:33,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:25:33,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:25:33,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:25:33,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:25:33,216 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:25:33,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:25:33,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:25:33,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:25:33,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:25:33,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:25:33,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:25:33,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:25:33,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:25:33,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:25:33,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:25:33,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:25:33,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:25:33,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:25:33,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:25:33,231 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 12:25:33,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:25:33,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:25:33,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:25:33,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:25:33,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:25:33,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:25:33,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:25:33,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:25:33,306 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:25:33,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:25:33,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:25:33,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:25:33,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:25:33,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:25:33,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:25:33,309 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:25:33,309 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:25:33,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:25:33,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:25:33,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:25:33,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:25:33,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:25:33,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:25:33,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:25:33,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:25:33,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:25:33,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:25:33,312 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:25:33,312 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:25:33,313 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:25:33,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:25:33,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:25:33,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:25:33,314 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/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_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-11-16 12:25:33,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:25:33,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:25:33,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:25:33,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:25:33,791 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:25:33,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-16 12:25:33,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/2889e8475/25f4a97d307540aca4c88aa77193d4e4/FLAG6f00b7258 [2022-11-16 12:25:34,926 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:25:34,927 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-16 12:25:34,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/2889e8475/25f4a97d307540aca4c88aa77193d4e4/FLAG6f00b7258 [2022-11-16 12:25:35,305 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/data/2889e8475/25f4a97d307540aca4c88aa77193d4e4 [2022-11-16 12:25:35,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:25:35,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:25:35,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:25:35,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:25:35,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:25:35,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:35" (1/1) ... [2022-11-16 12:25:35,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306c931b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:35, skipping insertion in model container [2022-11-16 12:25:35,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:25:35" (1/1) ... [2022-11-16 12:25:35,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:25:35,473 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:25:37,058 WARN L229 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_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-16 12:25:37,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:37,220 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 12:25:37,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:25:37,525 WARN L229 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_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-16 12:25:37,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:37,613 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:25:37,908 WARN L229 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_75b5be48-9f27-485e-afcf-78d6065b164a/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-16 12:25:37,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:25:38,288 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:25:38,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38 WrapperNode [2022-11-16 12:25:38,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:25:38,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:25:38,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:25:38,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:25:38,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,453 INFO L138 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-11-16 12:25:38,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:25:38,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:25:38,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:25:38,455 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:25:38,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,595 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:25:38,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:25:38,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:25:38,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:25:38,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (1/1) ... [2022-11-16 12:25:38,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:25:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:25:38,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:25:38,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:25:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-16 12:25:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-16 12:25:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-11-16 12:25:38,708 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-11-16 12:25:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 12:25:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-16 12:25:38,709 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-16 12:25:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-16 12:25:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 12:25:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 12:25:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-16 12:25:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 12:25:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-16 12:25:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-16 12:25:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-16 12:25:38,710 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-16 12:25:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-11-16 12:25:38,711 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-11-16 12:25:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-11-16 12:25:38,711 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-11-16 12:25:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-11-16 12:25:38,711 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-11-16 12:25:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 12:25:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 12:25:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-16 12:25:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-16 12:25:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:25:38,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:25:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-11-16 12:25:38,713 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-11-16 12:25:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-16 12:25:38,713 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-16 12:25:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-16 12:25:38,713 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-16 12:25:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-16 12:25:38,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-16 12:25:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-11-16 12:25:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-11-16 12:25:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-16 12:25:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-11-16 12:25:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-16 12:25:38,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-16 12:25:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-16 12:25:38,715 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-16 12:25:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 12:25:38,716 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 12:25:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-16 12:25:38,716 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-16 12:25:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:25:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-11-16 12:25:38,717 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-11-16 12:25:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-16 12:25:38,717 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-16 12:25:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-16 12:25:38,741 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-16 12:25:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-11-16 12:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-11-16 12:25:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-11-16 12:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-11-16 12:25:38,743 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-11-16 12:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-11-16 12:25:38,743 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-11-16 12:25:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-16 12:25:38,744 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-16 12:25:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-16 12:25:38,744 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-16 12:25:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-16 12:25:38,744 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-16 12:25:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-11-16 12:25:38,745 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-11-16 12:25:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-16 12:25:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-16 12:25:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-16 12:25:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-16 12:25:38,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-16 12:25:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:25:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:25:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:25:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-16 12:25:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:25:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 12:25:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-16 12:25:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-16 12:25:38,747 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-16 12:25:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-16 12:25:38,747 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-16 12:25:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-16 12:25:38,748 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-16 12:25:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-16 12:25:38,748 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-16 12:25:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-16 12:25:38,748 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-16 12:25:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-16 12:25:38,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-16 12:25:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-11-16 12:25:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-16 12:25:38,749 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-16 12:25:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-16 12:25:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:25:38,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:25:39,292 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:25:39,295 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:25:50,545 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-16 12:25:50,713 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 12:25:50,726 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-16 12:26:03,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-11-16 12:26:03,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-11-16 12:26:03,909 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-11-16 12:26:03,910 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-11-16 12:26:03,975 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:26:03,988 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:26:03,988 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-16 12:26:03,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:03 BoogieIcfgContainer [2022-11-16 12:26:03,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:26:03,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:26:03,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:26:04,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:26:04,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:25:35" (1/3) ... [2022-11-16 12:26:04,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6a8726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:04, skipping insertion in model container [2022-11-16 12:26:04,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:25:38" (2/3) ... [2022-11-16 12:26:04,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6a8726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:04, skipping insertion in model container [2022-11-16 12:26:04,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:03" (3/3) ... [2022-11-16 12:26:04,042 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-16 12:26:04,066 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:26:04,066 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:26:04,167 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:26:04,180 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;@3544c56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:26:04,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 12:26:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-11-16 12:26:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:26:04,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:04,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:04,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-11-16 12:26:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:04,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329518920] [2022-11-16 12:26:04,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:04,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:04,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:04,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:04,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 12:26:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:04,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:26:05,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:05,218 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-16 12:26:05,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:05,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:05,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329518920] [2022-11-16 12:26:05,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329518920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:05,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:05,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:26:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486161508] [2022-11-16 12:26:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:05,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:05,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:05,279 INFO L87 Difference]: Start difference. First operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-16 12:26:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:05,567 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-11-16 12:26:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:26:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-16 12:26:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:05,590 INFO L225 Difference]: With dead ends: 1076 [2022-11-16 12:26:05,590 INFO L226 Difference]: Without dead ends: 540 [2022-11-16 12:26:05,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:05,603 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:05,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3140 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:26:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-16 12:26:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-11-16 12:26:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 378 states have (on average 1.216931216931217) internal successors, (460), 386 states have internal predecessors, (460), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-11-16 12:26:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-11-16 12:26:05,710 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-11-16 12:26:05,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:05,711 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-11-16 12:26:05,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-16 12:26:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-11-16 12:26:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 12:26:05,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:05,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:26:05,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:05,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:05,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:05,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-11-16 12:26:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:05,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404058728] [2022-11-16 12:26:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:05,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:05,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:05,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:05,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 12:26:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:06,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:26:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:06,943 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-16 12:26:06,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:06,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404058728] [2022-11-16 12:26:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404058728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:06,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:06,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:26:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96640172] [2022-11-16 12:26:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:06,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:06,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:06,947 INFO L87 Difference]: Start difference. First operand 535 states and 700 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-16 12:26:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:07,106 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-11-16 12:26:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:07,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-16 12:26:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:07,124 INFO L225 Difference]: With dead ends: 1565 [2022-11-16 12:26:07,125 INFO L226 Difference]: Without dead ends: 1048 [2022-11-16 12:26:07,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-16 12:26:07,130 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 676 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1649 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-16 12:26:07,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1649 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:26:07,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-11-16 12:26:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-11-16 12:26:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 738 states have (on average 1.2168021680216803) internal successors, (898), 751 states have internal predecessors, (898), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-11-16 12:26:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-11-16 12:26:07,254 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-11-16 12:26:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:07,255 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-11-16 12:26:07,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-16 12:26:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-11-16 12:26:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 12:26:07,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:07,256 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-16 12:26:07,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:07,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:07,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:07,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-11-16 12:26:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:07,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404577970] [2022-11-16 12:26:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:07,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:07,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:07,476 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:07,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 12:26:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:08,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:26:08,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:08,330 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-16 12:26:08,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:08,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:08,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404577970] [2022-11-16 12:26:08,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404577970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:08,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:08,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:26:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648005664] [2022-11-16 12:26:08,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:08,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:08,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:08,333 INFO L87 Difference]: Start difference. First operand 1045 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-16 12:26:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:08,448 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-11-16 12:26:08,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-16 12:26:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:08,457 INFO L225 Difference]: With dead ends: 1047 [2022-11-16 12:26:08,457 INFO L226 Difference]: Without dead ends: 1036 [2022-11-16 12:26:08,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-16 12:26:08,463 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 678 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:08,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:26:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-11-16 12:26:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-11-16 12:26:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 728 states have (on average 1.2115384615384615) internal successors, (882), 739 states have internal predecessors, (882), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-11-16 12:26:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-11-16 12:26:08,590 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-11-16 12:26:08,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:08,590 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-11-16 12:26:08,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-16 12:26:08,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-11-16 12:26:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 12:26:08,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:08,602 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] [2022-11-16 12:26:08,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:08,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:08,826 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-11-16 12:26:08,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:08,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47794106] [2022-11-16 12:26:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:08,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:08,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:08,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:08,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 12:26:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:09,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 12:26:09,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:09,723 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-16 12:26:09,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:09,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47794106] [2022-11-16 12:26:09,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47794106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:09,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:09,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:26:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758323413] [2022-11-16 12:26:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:09,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:26:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:09,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:26:09,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:26:09,726 INFO L87 Difference]: Start difference. First operand 1031 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:26:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:09,965 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-11-16 12:26:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:26:09,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-16 12:26:09,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:09,975 INFO L225 Difference]: With dead ends: 2353 [2022-11-16 12:26:09,976 INFO L226 Difference]: Without dead ends: 1334 [2022-11-16 12:26:09,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-16 12:26:09,982 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 262 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1321 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:26:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-11-16 12:26:10,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-11-16 12:26:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2338624338624338) internal successors, (1166), 964 states have internal predecessors, (1166), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-11-16 12:26:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-11-16 12:26:10,120 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-11-16 12:26:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:10,121 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-11-16 12:26:10,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-16 12:26:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-11-16 12:26:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-16 12:26:10,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:10,130 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:26:10,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:10,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:10,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:10,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-11-16 12:26:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220691210] [2022-11-16 12:26:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:10,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:10,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:10,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 12:26:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:11,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:26:11,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:26:11,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:11,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220691210] [2022-11-16 12:26:11,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220691210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:11,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:11,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:26:11,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074733778] [2022-11-16 12:26:11,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:11,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:26:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:26:11,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:26:11,192 INFO L87 Difference]: Start difference. First operand 1330 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:26:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:11,560 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-11-16 12:26:11,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:26:11,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-11-16 12:26:11,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:11,570 INFO L225 Difference]: With dead ends: 2669 [2022-11-16 12:26:11,570 INFO L226 Difference]: Without dead ends: 1343 [2022-11-16 12:26:11,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:26:11,577 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 12 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:11,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2075 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:26:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-16 12:26:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-11-16 12:26:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 947 states have (on average 1.232312565997888) internal successors, (1167), 967 states have internal predecessors, (1167), 318 states have call successors, (318), 68 states have call predecessors, (318), 67 states have return successors, (319), 311 states have call predecessors, (319), 315 states have call successors, (319) [2022-11-16 12:26:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-11-16 12:26:11,724 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-11-16 12:26:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:11,726 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-11-16 12:26:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-16 12:26:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-11-16 12:26:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-16 12:26:11,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:11,730 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-16 12:26:11,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:11,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:11,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-11-16 12:26:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795746092] [2022-11-16 12:26:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:11,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:11,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 12:26:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:12,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 12:26:12,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:26:12,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:12,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:12,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795746092] [2022-11-16 12:26:12,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795746092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:12,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:12,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:26:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792751918] [2022-11-16 12:26:12,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:12,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:26:12,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:12,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:26:12,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:26:12,752 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 12:26:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:13,121 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-11-16 12:26:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:26:13,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-11-16 12:26:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:13,130 INFO L225 Difference]: With dead ends: 2675 [2022-11-16 12:26:13,130 INFO L226 Difference]: Without dead ends: 1346 [2022-11-16 12:26:13,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:26:13,137 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 12 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:13,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2062 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 12:26:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-11-16 12:26:13,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-11-16 12:26:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2317460317460318) internal successors, (1164), 966 states have internal predecessors, (1164), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-11-16 12:26:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-11-16 12:26:13,297 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-11-16 12:26:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:13,298 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-11-16 12:26:13,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-16 12:26:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-11-16 12:26:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-16 12:26:13,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:13,317 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:26:13,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:13,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:13,531 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-11-16 12:26:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:13,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456024052] [2022-11-16 12:26:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:13,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:13,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:13,538 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:13,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 12:26:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:14,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:26:14,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-16 12:26:14,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:14,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:14,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456024052] [2022-11-16 12:26:14,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456024052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:14,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:14,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:26:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215077738] [2022-11-16 12:26:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:14,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:26:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:26:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:26:14,793 INFO L87 Difference]: Start difference. First operand 1330 states and 1798 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:26:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:26:16,095 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-11-16 12:26:16,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:26:16,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 146 [2022-11-16 12:26:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:26:16,104 INFO L225 Difference]: With dead ends: 2671 [2022-11-16 12:26:16,104 INFO L226 Difference]: Without dead ends: 1351 [2022-11-16 12:26:16,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:16,110 INFO L413 NwaCegarLoop]: 699 mSDtfsCounter, 15 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:26:16,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3468 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 12:26:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-16 12:26:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-11-16 12:26:16,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2305263157894737) internal successors, (1169), 972 states have internal predecessors, (1169), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-11-16 12:26:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-11-16 12:26:16,248 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-11-16 12:26:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:26:16,249 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-11-16 12:26:16,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-16 12:26:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-11-16 12:26:16,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-16 12:26:16,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:26:16,253 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:26:16,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 12:26:16,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:16,476 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:26:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:26:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-11-16 12:26:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:26:16,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579412576] [2022-11-16 12:26:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:26:16,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:26:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:26:16,480 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:26:16,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 12:26:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:26:17,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:26:17,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:26:17,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:26:17,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:26:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:26:17,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:26:17,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:26:17,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579412576] [2022-11-16 12:26:17,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579412576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:26:17,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:26:17,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:26:17,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491946256] [2022-11-16 12:26:17,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:26:17,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:26:17,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:26:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:26:17,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:26:17,838 INFO L87 Difference]: Start difference. First operand 1337 states and 1808 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-16 12:26:20,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:22,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:24,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:26,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:28,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:30,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:32,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:34,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:36,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:38,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:40,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:41,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:43,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:45,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:46,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:48,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:50,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:53,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:54,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:56,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:26:58,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:00,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:02,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:04,138 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-11-16 12:27:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:27:04,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-11-16 12:27:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:04,149 INFO L225 Difference]: With dead ends: 1399 [2022-11-16 12:27:04,149 INFO L226 Difference]: Without dead ends: 1339 [2022-11-16 12:27:04,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:27:04,151 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:04,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 17 Unknown, 0 Unchecked, 46.0s Time] [2022-11-16 12:27:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-11-16 12:27:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-11-16 12:27:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2284210526315789) internal successors, (1167), 972 states have internal predecessors, (1167), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-11-16 12:27:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-11-16 12:27:04,263 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-11-16 12:27:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:04,264 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-11-16 12:27:04,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-16 12:27:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-11-16 12:27:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:27:04,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:04,267 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:27:04,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:04,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-11-16 12:27:04,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:04,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799195686] [2022-11-16 12:27:04,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:04,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:04,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:04,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:04,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 12:27:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:10,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 12:27:10,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:10,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:27:11,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:27:11,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:27:11,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:27:12,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:27:12,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:27:12,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:27:12,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:27:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-16 12:27:12,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:27:13,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:13,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799195686] [2022-11-16 12:27:13,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799195686] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:27:13,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:27:13,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-11-16 12:27:13,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105638007] [2022-11-16 12:27:13,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:13,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:13,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:13,104 INFO L87 Difference]: Start difference. First operand 1337 states and 1806 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-16 12:27:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:13,504 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-11-16 12:27:13,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:27:13,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2022-11-16 12:27:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:13,513 INFO L225 Difference]: With dead ends: 2386 [2022-11-16 12:27:13,513 INFO L226 Difference]: Without dead ends: 1008 [2022-11-16 12:27:13,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:27:13,520 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3408 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:13,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3408 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2022-11-16 12:27:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-11-16 12:27:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-11-16 12:27:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 717 states have (on average 1.2259414225941423) internal successors, (879), 734 states have internal predecessors, (879), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-11-16 12:27:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-11-16 12:27:13,602 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-11-16 12:27:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:13,603 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-11-16 12:27:13,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-16 12:27:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-11-16 12:27:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:27:13,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:13,607 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:13,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:13,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:13,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:13,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:13,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-11-16 12:27:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:13,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813063475] [2022-11-16 12:27:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:27:13,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:13,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:13,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:13,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 12:27:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:27:14,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:27:14,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-16 12:27:15,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:27:15,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:15,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813063475] [2022-11-16 12:27:15,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813063475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:27:15,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:27:15,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:27:15,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611138967] [2022-11-16 12:27:15,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:27:15,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:27:15,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:15,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:27:15,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:15,170 INFO L87 Difference]: Start difference. First operand 1008 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:27:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:27:15,368 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-11-16 12:27:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:27:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-11-16 12:27:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:27:15,375 INFO L225 Difference]: With dead ends: 1696 [2022-11-16 12:27:15,376 INFO L226 Difference]: Without dead ends: 1011 [2022-11-16 12:27:15,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:27:15,379 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:27:15,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4125 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:27:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-16 12:27:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-11-16 12:27:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 720 states have (on average 1.2236111111111112) internal successors, (881), 735 states have internal predecessors, (881), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 223 states have call predecessors, (231), 224 states have call successors, (231) [2022-11-16 12:27:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-11-16 12:27:15,458 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-11-16 12:27:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:27:15,458 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-11-16 12:27:15,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 12:27:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-11-16 12:27:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:27:15,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:27:15,462 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:27:15,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 12:27:15,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:15,689 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:27:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:27:15,690 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-11-16 12:27:15,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:27:15,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041483029] [2022-11-16 12:27:15,691 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:27:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:27:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:27:15,692 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:27:15,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 12:27:18,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:27:18,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:27:18,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 12:27:18,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:27:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-16 12:27:18,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:27:19,888 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-16 12:27:19,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:27:19,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041483029] [2022-11-16 12:27:19,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041483029] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:27:19,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:27:19,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-11-16 12:27:19,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537365597] [2022-11-16 12:27:19,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:27:19,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 12:27:19,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:27:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 12:27:19,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:27:19,892 INFO L87 Difference]: Start difference. First operand 1011 states and 1338 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-16 12:27:22,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:24,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:28,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:31,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:32,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:34,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:35,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:37,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:40,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:42,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:44,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:46,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:48,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:50,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:52,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:27:55,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:01,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:05,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:07,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:11,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:13,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:15,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:17,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:19,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:23,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:27,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:28,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:30,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:31,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:33,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:35,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:38,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:40,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:42,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:47,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:28:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:49,413 INFO L93 Difference]: Finished difference Result 4376 states and 5892 transitions. [2022-11-16 12:28:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:28:49,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 147 [2022-11-16 12:28:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:49,437 INFO L225 Difference]: With dead ends: 4376 [2022-11-16 12:28:49,438 INFO L226 Difference]: Without dead ends: 3654 [2022-11-16 12:28:49,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-11-16 12:28:49,443 INFO L413 NwaCegarLoop]: 1648 mSDtfsCounter, 4050 mSDsluCounter, 4195 mSDsCounter, 0 mSdLazyCounter, 5987 mSolverCounterSat, 1992 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 85.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4329 SdHoareTripleChecker+Valid, 5843 SdHoareTripleChecker+Invalid, 7999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1992 IncrementalHoareTripleChecker+Valid, 5987 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:49,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4329 Valid, 5843 Invalid, 7999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1992 Valid, 5987 Invalid, 20 Unknown, 0 Unchecked, 88.6s Time] [2022-11-16 12:28:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2022-11-16 12:28:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3544. [2022-11-16 12:28:49,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 2514 states have (on average 1.224741447891806) internal successors, (3079), 2572 states have internal predecessors, (3079), 812 states have call successors, (812), 212 states have call predecessors, (812), 217 states have return successors, (901), 794 states have call predecessors, (901), 808 states have call successors, (901) [2022-11-16 12:28:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 4792 transitions. [2022-11-16 12:28:49,803 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 4792 transitions. Word has length 147 [2022-11-16 12:28:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 3544 states and 4792 transitions. [2022-11-16 12:28:49,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-16 12:28:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 4792 transitions. [2022-11-16 12:28:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-16 12:28:49,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:49,809 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-16 12:28:49,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:50,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:50,033 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:28:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:50,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1296056406, now seen corresponding path program 1 times [2022-11-16 12:28:50,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:50,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126240773] [2022-11-16 12:28:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:28:50,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:50,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:50,037 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:50,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 12:28:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:28:51,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:28:51,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-16 12:28:51,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:28:51,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:51,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126240773] [2022-11-16 12:28:51,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126240773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:28:51,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:28:51,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:28:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69418693] [2022-11-16 12:28:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:51,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:28:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:28:51,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:28:51,359 INFO L87 Difference]: Start difference. First operand 3544 states and 4792 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 12:28:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:28:51,765 INFO L93 Difference]: Finished difference Result 6745 states and 9168 transitions. [2022-11-16 12:28:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:28:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2022-11-16 12:28:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:28:51,787 INFO L225 Difference]: With dead ends: 6745 [2022-11-16 12:28:51,788 INFO L226 Difference]: Without dead ends: 3544 [2022-11-16 12:28:51,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:28:51,800 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 2 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:28:51,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4138 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:28:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2022-11-16 12:28:52,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3540. [2022-11-16 12:28:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3540 states, 2510 states have (on average 1.2235059760956175) internal successors, (3071), 2570 states have internal predecessors, (3071), 812 states have call successors, (812), 212 states have call predecessors, (812), 217 states have return successors, (901), 792 states have call predecessors, (901), 808 states have call successors, (901) [2022-11-16 12:28:52,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4784 transitions. [2022-11-16 12:28:52,131 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4784 transitions. Word has length 157 [2022-11-16 12:28:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:28:52,132 INFO L495 AbstractCegarLoop]: Abstraction has 3540 states and 4784 transitions. [2022-11-16 12:28:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 12:28:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4784 transitions. [2022-11-16 12:28:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-16 12:28:52,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:28:52,136 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:28:52,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 12:28:52,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:52,360 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:28:52,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:28:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -864733802, now seen corresponding path program 2 times [2022-11-16 12:28:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:28:52,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746366770] [2022-11-16 12:28:52,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:28:52,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:28:52,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:28:52,363 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:28:52,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 12:28:54,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:28:54,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:28:54,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:28:54,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:28:55,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:28:55,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:28:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:28:55,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:28:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-16 12:28:55,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:28:55,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746366770] [2022-11-16 12:28:55,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746366770] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:28:55,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:28:55,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2022-11-16 12:28:55,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344227653] [2022-11-16 12:28:55,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:28:55,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:28:55,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:28:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:28:55,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:28:55,880 INFO L87 Difference]: Start difference. First operand 3540 states and 4784 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:28:58,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:00,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:02,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:04,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:06,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:08,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:10,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:12,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:14,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:16,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:21,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:23,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:25,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:27,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:30,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:32,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:34,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:36,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:38,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:39,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:29:40,830 INFO L93 Difference]: Finished difference Result 3691 states and 4972 transitions. [2022-11-16 12:29:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:29:40,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-11-16 12:29:40,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:29:40,856 INFO L225 Difference]: With dead ends: 3691 [2022-11-16 12:29:40,856 INFO L226 Difference]: Without dead ends: 3542 [2022-11-16 12:29:40,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:29:40,860 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 5 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 5 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:29:40,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3863 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 269 Invalid, 16 Unknown, 0 Unchecked, 44.6s Time] [2022-11-16 12:29:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2022-11-16 12:29:41,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3542. [2022-11-16 12:29:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 2511 states have (on average 1.2222222222222223) internal successors, (3069), 2572 states have internal predecessors, (3069), 813 states have call successors, (813), 212 states have call predecessors, (813), 217 states have return successors, (901), 792 states have call predecessors, (901), 808 states have call successors, (901) [2022-11-16 12:29:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 4783 transitions. [2022-11-16 12:29:41,222 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 4783 transitions. Word has length 157 [2022-11-16 12:29:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:29:41,222 INFO L495 AbstractCegarLoop]: Abstraction has 3542 states and 4783 transitions. [2022-11-16 12:29:41,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:29:41,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4783 transitions. [2022-11-16 12:29:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-16 12:29:41,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:29:41,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-16 12:29:41,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 12:29:41,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:41,464 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:29:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:29:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash 507809139, now seen corresponding path program 1 times [2022-11-16 12:29:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:29:41,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487655513] [2022-11-16 12:29:41,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:29:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:29:41,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:29:41,467 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:29:41,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 12:29:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:29:46,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 12:29:46,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:29:47,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:29:47,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:29:47,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:29:47,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:29:47,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:29:48,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:29:48,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:29:48,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-16 12:29:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-16 12:29:48,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:29:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-16 12:29:48,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:29:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487655513] [2022-11-16 12:29:48,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487655513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:29:48,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:29:48,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-11-16 12:29:48,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279823719] [2022-11-16 12:29:48,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:29:48,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:29:48,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:29:48,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:29:48,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:29:48,436 INFO L87 Difference]: Start difference. First operand 3542 states and 4783 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-16 12:29:50,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:52,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:54,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:56,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:29:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:01,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:03,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:05,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:08,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:10,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:12,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:30:13,395 INFO L93 Difference]: Finished difference Result 5945 states and 8030 transitions. [2022-11-16 12:30:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:30:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 158 [2022-11-16 12:30:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:30:13,412 INFO L225 Difference]: With dead ends: 5945 [2022-11-16 12:30:13,412 INFO L226 Difference]: Without dead ends: 2674 [2022-11-16 12:30:13,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 306 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:30:13,422 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 5 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3984 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:30:13,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3984 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 8 Unknown, 91 Unchecked, 24.6s Time] [2022-11-16 12:30:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2022-11-16 12:30:13,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2672. [2022-11-16 12:30:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 1892 states have (on average 1.220401691331924) internal successors, (2309), 1938 states have internal predecessors, (2309), 605 states have call successors, (605), 164 states have call predecessors, (605), 174 states have return successors, (680), 595 states have call predecessors, (680), 602 states have call successors, (680) [2022-11-16 12:30:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3594 transitions. [2022-11-16 12:30:13,672 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 3594 transitions. Word has length 158 [2022-11-16 12:30:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:30:13,673 INFO L495 AbstractCegarLoop]: Abstraction has 2672 states and 3594 transitions. [2022-11-16 12:30:13,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-16 12:30:13,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3594 transitions. [2022-11-16 12:30:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-16 12:30:13,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:30:13,677 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-16 12:30:13,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 12:30:13,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:13,899 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:30:13,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:30:13,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1189281783, now seen corresponding path program 1 times [2022-11-16 12:30:13,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:30:13,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187691006] [2022-11-16 12:30:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:30:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 12:30:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:30:13,903 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 12:30:13,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_75b5be48-9f27-485e-afcf-78d6065b164a/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 12:30:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:30:14,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 12:30:14,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:30:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-16 12:30:15,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:30:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-16 12:30:17,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:30:17,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187691006] [2022-11-16 12:30:17,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187691006] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:30:17,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:30:17,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2022-11-16 12:30:17,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278085485] [2022-11-16 12:30:17,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:30:17,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-16 12:30:17,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:30:17,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-16 12:30:17,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-11-16 12:30:17,594 INFO L87 Difference]: Start difference. First operand 2672 states and 3594 transitions. Second operand has 22 states, 22 states have (on average 6.909090909090909) internal successors, (152), 22 states have internal predecessors, (152), 17 states have call successors, (31), 10 states have call predecessors, (31), 7 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-16 12:30:20,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:22,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:26,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:31,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:33,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:35,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:37,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:39,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:42,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:45,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:47,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:49,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:51,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:53,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:55,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:30:58,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:00,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:05,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:08,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:31:13,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []