./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:27:07,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:07,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:07,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:07,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:07,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:07,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:07,964 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:07,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:07,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:07,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:07,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:07,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:07,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:07,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:07,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:07,976 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:07,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:07,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:07,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:07,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:07,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:07,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:07,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:08,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:08,011 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:08,011 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:08,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:08,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:08,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:08,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:08,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:08,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:08,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:08,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:08,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:08,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:08,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:08,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:08,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:08,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:08,026 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 09:27:08,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:08,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:08,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:08,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:08,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:08,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:08,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:08,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:08,072 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:08,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:08,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:08,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:08,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:08,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:08,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:08,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:08,075 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:08,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:08,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:08,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:08,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:08,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:08,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:08,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:08,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:08,078 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:08,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:08,078 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:08,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:08,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:08,079 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_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-20 09:27:08,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:08,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:08,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:08,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:08,416 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:08,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 09:27:11,371 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:11,849 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:11,852 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 09:27:11,878 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data/6fa603b01/9c6c26084eae4d2c95f3d1c7ded0a672/FLAG377f19b26 [2022-11-20 09:27:11,898 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data/6fa603b01/9c6c26084eae4d2c95f3d1c7ded0a672 [2022-11-20 09:27:11,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:11,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:11,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:11,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:11,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:11,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:11" (1/1) ... [2022-11-20 09:27:11,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da75d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:11, skipping insertion in model container [2022-11-20 09:27:11,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:11" (1/1) ... [2022-11-20 09:27:11,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:12,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:12,702 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-20 09:27:12,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,768 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:13,080 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113815,113828] [2022-11-20 09:27:13,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:13,131 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:13,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13 WrapperNode [2022-11-20 09:27:13,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:13,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:13,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:13,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:13,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,243 INFO L138 Inliner]: procedures = 109, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 800 [2022-11-20 09:27:13,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:13,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:13,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:13,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:13,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:13,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:13,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:13,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:13,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (1/1) ... [2022-11-20 09:27:13,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:13,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:13,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:13,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:13,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 09:27:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 09:27:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:27:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-20 09:27:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-20 09:27:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 09:27:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 09:27:13,463 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 09:27:13,463 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 09:27:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-20 09:27:13,464 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-20 09:27:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:27:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 09:27:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 09:27:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-20 09:27:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-20 09:27:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-20 09:27:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-20 09:27:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-20 09:27:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-20 09:27:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 09:27:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 09:27:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:27:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-20 09:27:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-20 09:27:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 09:27:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-20 09:27:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-20 09:27:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-20 09:27:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-20 09:27:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-20 09:27:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-20 09:27:13,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 09:27:13,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:27:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 09:27:13,470 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-20 09:27:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-20 09:27:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-20 09:27:13,471 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-20 09:27:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:13,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:13,871 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:13,873 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:13,970 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 09:27:14,758 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:14,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:14,766 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 09:27:14,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:14 BoogieIcfgContainer [2022-11-20 09:27:14,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:14,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:14,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:14,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:14,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:11" (1/3) ... [2022-11-20 09:27:14,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3993ae60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:14, skipping insertion in model container [2022-11-20 09:27:14,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:13" (2/3) ... [2022-11-20 09:27:14,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3993ae60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:14, skipping insertion in model container [2022-11-20 09:27:14,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:14" (3/3) ... [2022-11-20 09:27:14,777 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 09:27:14,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:14,797 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:27:14,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:14,859 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;@2447eb77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:14,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:27:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-11-20 09:27:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 09:27:14,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:14,874 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] [2022-11-20 09:27:14,875 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:14,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:14,881 INFO L85 PathProgramCache]: Analyzing trace with hash -914963392, now seen corresponding path program 1 times [2022-11-20 09:27:14,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:14,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351130928] [2022-11-20 09:27:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:15,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:15,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351130928] [2022-11-20 09:27:15,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351130928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:15,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:15,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108015578] [2022-11-20 09:27:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:15,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:15,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:15,591 INFO L87 Difference]: Start difference. First operand has 235 states, 175 states have (on average 1.3257142857142856) internal successors, (232), 186 states have internal predecessors, (232), 43 states have call successors, (43), 16 states have call predecessors, (43), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 09:27:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:16,225 INFO L93 Difference]: Finished difference Result 472 states and 646 transitions. [2022-11-20 09:27:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-20 09:27:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:16,243 INFO L225 Difference]: With dead ends: 472 [2022-11-20 09:27:16,258 INFO L226 Difference]: Without dead ends: 231 [2022-11-20 09:27:16,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:16,266 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 94 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:16,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 413 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:27:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-20 09:27:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2022-11-20 09:27:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 175 states have internal predecessors, (220), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-20 09:27:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2022-11-20 09:27:16,354 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 32 [2022-11-20 09:27:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:16,355 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2022-11-20 09:27:16,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 09:27:16,355 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2022-11-20 09:27:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 09:27:16,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:16,357 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] [2022-11-20 09:27:16,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:16,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash -492261566, now seen corresponding path program 1 times [2022-11-20 09:27:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:16,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045121335] [2022-11-20 09:27:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045121335] [2022-11-20 09:27:16,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045121335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:16,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:16,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:16,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489047053] [2022-11-20 09:27:16,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:16,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:16,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:16,562 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 09:27:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:17,460 INFO L93 Difference]: Finished difference Result 652 states and 865 transitions. [2022-11-20 09:27:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:27:17,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2022-11-20 09:27:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:17,471 INFO L225 Difference]: With dead ends: 652 [2022-11-20 09:27:17,472 INFO L226 Difference]: Without dead ends: 433 [2022-11-20 09:27:17,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:17,481 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 326 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:17,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 772 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:27:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-11-20 09:27:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 419. [2022-11-20 09:27:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 318 states have (on average 1.2893081761006289) internal successors, (410), 325 states have internal predecessors, (410), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-20 09:27:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 550 transitions. [2022-11-20 09:27:17,528 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 550 transitions. Word has length 32 [2022-11-20 09:27:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:17,528 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 550 transitions. [2022-11-20 09:27:17,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-20 09:27:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 550 transitions. [2022-11-20 09:27:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:17,531 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:17,531 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 09:27:17,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:17,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:17,532 INFO L85 PathProgramCache]: Analyzing trace with hash 453727969, now seen corresponding path program 1 times [2022-11-20 09:27:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:17,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162399699] [2022-11-20 09:27:17,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:27:17,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:17,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162399699] [2022-11-20 09:27:17,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162399699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:17,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:17,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:17,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309756815] [2022-11-20 09:27:17,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:17,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:17,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:17,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:17,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:17,761 INFO L87 Difference]: Start difference. First operand 419 states and 550 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 09:27:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:18,619 INFO L93 Difference]: Finished difference Result 990 states and 1341 transitions. [2022-11-20 09:27:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:27:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 55 [2022-11-20 09:27:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:18,624 INFO L225 Difference]: With dead ends: 990 [2022-11-20 09:27:18,624 INFO L226 Difference]: Without dead ends: 586 [2022-11-20 09:27:18,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:18,626 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 672 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:18,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1183 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:27:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-11-20 09:27:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 422. [2022-11-20 09:27:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 321 states have (on average 1.2834890965732086) internal successors, (412), 328 states have internal predecessors, (412), 72 states have call successors, (72), 29 states have call predecessors, (72), 28 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-20 09:27:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 552 transitions. [2022-11-20 09:27:18,674 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 552 transitions. Word has length 55 [2022-11-20 09:27:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:18,675 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 552 transitions. [2022-11-20 09:27:18,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-20 09:27:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 552 transitions. [2022-11-20 09:27:18,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 09:27:18,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:18,677 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 09:27:18,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:27:18,678 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:18,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:18,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1191044641, now seen corresponding path program 1 times [2022-11-20 09:27:18,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:18,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186320233] [2022-11-20 09:27:18,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:27:18,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:18,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186320233] [2022-11-20 09:27:18,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186320233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:18,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:18,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956121334] [2022-11-20 09:27:18,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:18,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:18,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:18,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:18,873 INFO L87 Difference]: Start difference. First operand 422 states and 552 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:19,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:19,647 INFO L93 Difference]: Finished difference Result 1257 states and 1665 transitions. [2022-11-20 09:27:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:27:19,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2022-11-20 09:27:19,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:19,653 INFO L225 Difference]: With dead ends: 1257 [2022-11-20 09:27:19,653 INFO L226 Difference]: Without dead ends: 850 [2022-11-20 09:27:19,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:19,655 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 401 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:19,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 714 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:27:19,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2022-11-20 09:27:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 820. [2022-11-20 09:27:19,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 628 states have (on average 1.2786624203821657) internal successors, (803), 639 states have internal predecessors, (803), 137 states have call successors, (137), 55 states have call predecessors, (137), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-20 09:27:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1073 transitions. [2022-11-20 09:27:19,726 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1073 transitions. Word has length 55 [2022-11-20 09:27:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:19,727 INFO L495 AbstractCegarLoop]: Abstraction has 820 states and 1073 transitions. [2022-11-20 09:27:19,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1073 transitions. [2022-11-20 09:27:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 09:27:19,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:19,729 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 09:27:19,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:27:19,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:19,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:19,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1732311739, now seen corresponding path program 1 times [2022-11-20 09:27:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:19,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845265781] [2022-11-20 09:27:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:27:19,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845265781] [2022-11-20 09:27:19,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845265781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:19,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:19,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98750476] [2022-11-20 09:27:19,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:19,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:19,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:19,905 INFO L87 Difference]: Start difference. First operand 820 states and 1073 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:20,408 INFO L93 Difference]: Finished difference Result 850 states and 1122 transitions. [2022-11-20 09:27:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-11-20 09:27:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:20,414 INFO L225 Difference]: With dead ends: 850 [2022-11-20 09:27:20,414 INFO L226 Difference]: Without dead ends: 847 [2022-11-20 09:27:20,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:20,415 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 285 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:20,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 539 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-11-20 09:27:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 819. [2022-11-20 09:27:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 628 states have (on average 1.2770700636942676) internal successors, (802), 638 states have internal predecessors, (802), 136 states have call successors, (136), 55 states have call predecessors, (136), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-20 09:27:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1071 transitions. [2022-11-20 09:27:20,501 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1071 transitions. Word has length 56 [2022-11-20 09:27:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:20,501 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1071 transitions. [2022-11-20 09:27:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1071 transitions. [2022-11-20 09:27:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:20,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:20,503 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 09:27:20,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:27:20,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:20,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2132925860, now seen corresponding path program 1 times [2022-11-20 09:27:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:20,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952256883] [2022-11-20 09:27:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:27:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:20,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952256883] [2022-11-20 09:27:20,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952256883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:20,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:20,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527260507] [2022-11-20 09:27:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:20,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:20,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:20,715 INFO L87 Difference]: Start difference. First operand 819 states and 1071 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:21,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:21,160 INFO L93 Difference]: Finished difference Result 849 states and 1120 transitions. [2022-11-20 09:27:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2022-11-20 09:27:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:21,165 INFO L225 Difference]: With dead ends: 849 [2022-11-20 09:27:21,165 INFO L226 Difference]: Without dead ends: 846 [2022-11-20 09:27:21,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:21,167 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 322 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:21,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 384 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:27:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2022-11-20 09:27:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 818. [2022-11-20 09:27:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 628 states have (on average 1.2754777070063694) internal successors, (801), 637 states have internal predecessors, (801), 135 states have call successors, (135), 55 states have call predecessors, (135), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-20 09:27:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1069 transitions. [2022-11-20 09:27:21,236 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1069 transitions. Word has length 57 [2022-11-20 09:27:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:21,236 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1069 transitions. [2022-11-20 09:27:21,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1069 transitions. [2022-11-20 09:27:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 09:27:21,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:21,238 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 09:27:21,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:27:21,238 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:21,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1696212008, now seen corresponding path program 1 times [2022-11-20 09:27:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:21,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845886594] [2022-11-20 09:27:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:21,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:27:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:21,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845886594] [2022-11-20 09:27:21,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845886594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:21,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:21,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233403360] [2022-11-20 09:27:21,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:21,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:21,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:21,379 INFO L87 Difference]: Start difference. First operand 818 states and 1069 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:21,757 INFO L93 Difference]: Finished difference Result 848 states and 1118 transitions. [2022-11-20 09:27:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-20 09:27:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:21,776 INFO L225 Difference]: With dead ends: 848 [2022-11-20 09:27:21,777 INFO L226 Difference]: Without dead ends: 837 [2022-11-20 09:27:21,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:21,778 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 319 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:21,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 383 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:27:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2022-11-20 09:27:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 809. [2022-11-20 09:27:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 620 states have (on average 1.2741935483870968) internal successors, (790), 628 states have internal predecessors, (790), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-20 09:27:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1057 transitions. [2022-11-20 09:27:21,848 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1057 transitions. Word has length 58 [2022-11-20 09:27:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:21,849 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1057 transitions. [2022-11-20 09:27:21,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-20 09:27:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1057 transitions. [2022-11-20 09:27:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-20 09:27:21,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:21,852 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:21,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:27:21,853 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:21,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1715867054, now seen corresponding path program 1 times [2022-11-20 09:27:21,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:21,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51218266] [2022-11-20 09:27:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:21,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-20 09:27:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-20 09:27:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 09:27:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 09:27:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 09:27:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 09:27:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 09:27:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 09:27:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 09:27:22,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:22,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51218266] [2022-11-20 09:27:22,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51218266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:22,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:22,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265408091] [2022-11-20 09:27:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:22,109 INFO L87 Difference]: Start difference. First operand 809 states and 1057 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:22,655 INFO L93 Difference]: Finished difference Result 1695 states and 2233 transitions. [2022-11-20 09:27:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 154 [2022-11-20 09:27:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:22,660 INFO L225 Difference]: With dead ends: 1695 [2022-11-20 09:27:22,661 INFO L226 Difference]: Without dead ends: 901 [2022-11-20 09:27:22,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:27:22,664 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 147 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:22,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 734 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-11-20 09:27:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 863. [2022-11-20 09:27:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 673 states have (on average 1.2838038632986628) internal successors, (864), 681 states have internal predecessors, (864), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-20 09:27:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1131 transitions. [2022-11-20 09:27:22,757 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1131 transitions. Word has length 154 [2022-11-20 09:27:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:22,757 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1131 transitions. [2022-11-20 09:27:22,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1131 transitions. [2022-11-20 09:27:22,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-20 09:27:22,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:22,764 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:22,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:27:22,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:22,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash 281231005, now seen corresponding path program 1 times [2022-11-20 09:27:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:22,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792171043] [2022-11-20 09:27:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-20 09:27:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 09:27:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 09:27:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-20 09:27:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-20 09:27:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:27:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-20 09:27:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 09:27:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-20 09:27:23,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:23,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792171043] [2022-11-20 09:27:23,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792171043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:23,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:23,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:27:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94974384] [2022-11-20 09:27:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:23,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:27:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:23,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:27:23,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:23,140 INFO L87 Difference]: Start difference. First operand 863 states and 1131 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:23,887 INFO L93 Difference]: Finished difference Result 2305 states and 3112 transitions. [2022-11-20 09:27:23,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-11-20 09:27:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:23,895 INFO L225 Difference]: With dead ends: 2305 [2022-11-20 09:27:23,896 INFO L226 Difference]: Without dead ends: 1461 [2022-11-20 09:27:23,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:23,903 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 455 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:23,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1773 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:27:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-11-20 09:27:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 875. [2022-11-20 09:27:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 685 states have (on average 1.2788321167883212) internal successors, (876), 693 states have internal predecessors, (876), 134 states have call successors, (134), 56 states have call predecessors, (134), 55 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2022-11-20 09:27:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1143 transitions. [2022-11-20 09:27:23,991 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1143 transitions. Word has length 163 [2022-11-20 09:27:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:23,993 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1143 transitions. [2022-11-20 09:27:23,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1143 transitions. [2022-11-20 09:27:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-20 09:27:23,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:23,998 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:23,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:27:23,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1992328740, now seen corresponding path program 1 times [2022-11-20 09:27:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:24,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097760504] [2022-11-20 09:27:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:24,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 09:27:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 09:27:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 09:27:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 09:27:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 09:27:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 09:27:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 09:27:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-20 09:27:24,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:24,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097760504] [2022-11-20 09:27:24,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097760504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:24,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726622391] [2022-11-20 09:27:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:24,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:24,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:24,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:24,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:27:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:27:25,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-20 09:27:25,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:25,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726622391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:25,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:25,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-20 09:27:25,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624478073] [2022-11-20 09:27:25,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:25,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:25,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:25,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:25,181 INFO L87 Difference]: Start difference. First operand 875 states and 1143 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:25,544 INFO L93 Difference]: Finished difference Result 2833 states and 3730 transitions. [2022-11-20 09:27:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-11-20 09:27:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:25,556 INFO L225 Difference]: With dead ends: 2833 [2022-11-20 09:27:25,556 INFO L226 Difference]: Without dead ends: 1977 [2022-11-20 09:27:25,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:27:25,560 INFO L413 NwaCegarLoop]: 592 mSDtfsCounter, 400 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:25,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1908 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:25,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2022-11-20 09:27:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 911. [2022-11-20 09:27:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.2678821879382889) internal successors, (904), 721 states have internal predecessors, (904), 142 states have call successors, (142), 56 states have call predecessors, (142), 55 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-11-20 09:27:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1187 transitions. [2022-11-20 09:27:25,705 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1187 transitions. Word has length 165 [2022-11-20 09:27:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:25,706 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1187 transitions. [2022-11-20 09:27:25,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1187 transitions. [2022-11-20 09:27:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-11-20 09:27:25,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:25,711 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:25,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-20 09:27:25,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 09:27:25,919 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 981211490, now seen corresponding path program 1 times [2022-11-20 09:27:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:25,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659799242] [2022-11-20 09:27:25,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:25,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 09:27:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 09:27:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 09:27:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 09:27:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 09:27:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 09:27:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-11-20 09:27:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-20 09:27:26,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:26,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659799242] [2022-11-20 09:27:26,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659799242] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:26,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147773599] [2022-11-20 09:27:26,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:26,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:26,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:26,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:26,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:27:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:27,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 1324 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 09:27:27,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-20 09:27:27,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:27,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147773599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:27,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:27,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-20 09:27:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187612040] [2022-11-20 09:27:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:27,136 INFO L87 Difference]: Start difference. First operand 911 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:27,307 INFO L93 Difference]: Finished difference Result 1831 states and 2411 transitions. [2022-11-20 09:27:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 165 [2022-11-20 09:27:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:27,313 INFO L225 Difference]: With dead ends: 1831 [2022-11-20 09:27:27,313 INFO L226 Difference]: Without dead ends: 939 [2022-11-20 09:27:27,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:27:27,316 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 1 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:27,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1132 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:27:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-11-20 09:27:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 927. [2022-11-20 09:27:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 725 states have (on average 1.2634482758620689) internal successors, (916), 733 states have internal predecessors, (916), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 145 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-20 09:27:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1219 transitions. [2022-11-20 09:27:27,443 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1219 transitions. Word has length 165 [2022-11-20 09:27:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:27,444 INFO L495 AbstractCegarLoop]: Abstraction has 927 states and 1219 transitions. [2022-11-20 09:27:27,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:27:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1219 transitions. [2022-11-20 09:27:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-20 09:27:27,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:27,448 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:27:27,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:27,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-20 09:27:27,656 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:27,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1506840738, now seen corresponding path program 1 times [2022-11-20 09:27:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:27,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443017951] [2022-11-20 09:27:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:27:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:27:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 09:27:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:27:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 09:27:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 09:27:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-20 09:27:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-20 09:27:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443017951] [2022-11-20 09:27:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443017951] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:28,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474576197] [2022-11-20 09:27:28,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:28,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:28,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:28,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:29,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:27:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-20 09:27:29,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-20 09:27:29,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:29,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474576197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:29,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:29,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2022-11-20 09:27:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561627503] [2022-11-20 09:27:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:29,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:29,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:29,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:29,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:27:29,851 INFO L87 Difference]: Start difference. First operand 927 states and 1219 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 09:27:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:30,956 INFO L93 Difference]: Finished difference Result 3347 states and 4705 transitions. [2022-11-20 09:27:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:27:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-11-20 09:27:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:30,969 INFO L225 Difference]: With dead ends: 3347 [2022-11-20 09:27:30,970 INFO L226 Difference]: Without dead ends: 2889 [2022-11-20 09:27:30,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-11-20 09:27:30,973 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 841 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:30,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 3554 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:27:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2022-11-20 09:27:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 939. [2022-11-20 09:27:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 737 states have (on average 1.2591587516960652) internal successors, (928), 741 states have internal predecessors, (928), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-20 09:27:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1231 transitions. [2022-11-20 09:27:31,190 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1231 transitions. Word has length 171 [2022-11-20 09:27:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:31,191 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1231 transitions. [2022-11-20 09:27:31,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 6 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 09:27:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1231 transitions. [2022-11-20 09:27:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-20 09:27:31,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:31,195 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:31,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:31,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 09:27:31,406 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:31,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1514027366, now seen corresponding path program 2 times [2022-11-20 09:27:31,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:31,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444642321] [2022-11-20 09:27:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:27:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:27:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 09:27:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:27:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 09:27:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 09:27:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 09:27:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-20 09:27:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:32,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444642321] [2022-11-20 09:27:32,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444642321] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:32,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305126487] [2022-11-20 09:27:32,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:27:32,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:32,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:32,519 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:32,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:27:32,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:27:32,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:32,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-20 09:27:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-20 09:27:33,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:33,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305126487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:33,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:33,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-20 09:27:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987260470] [2022-11-20 09:27:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:33,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:33,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:27:33,120 INFO L87 Difference]: Start difference. First operand 939 states and 1231 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 09:27:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:33,682 INFO L93 Difference]: Finished difference Result 1903 states and 2581 transitions. [2022-11-20 09:27:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:33,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 177 [2022-11-20 09:27:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:33,689 INFO L225 Difference]: With dead ends: 1903 [2022-11-20 09:27:33,689 INFO L226 Difference]: Without dead ends: 1439 [2022-11-20 09:27:33,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-20 09:27:33,692 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 572 mSDsluCounter, 1498 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:33,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1976 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:27:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2022-11-20 09:27:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 945. [2022-11-20 09:27:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 743 states have (on average 1.2570659488559892) internal successors, (934), 747 states have internal predecessors, (934), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (161), 149 states have call predecessors, (161), 141 states have call successors, (161) [2022-11-20 09:27:33,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1237 transitions. [2022-11-20 09:27:33,975 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1237 transitions. Word has length 177 [2022-11-20 09:27:33,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:33,976 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1237 transitions. [2022-11-20 09:27:33,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-20 09:27:33,976 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1237 transitions. [2022-11-20 09:27:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-20 09:27:33,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:33,982 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:27:33,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:34,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 09:27:34,189 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1738426959, now seen corresponding path program 1 times [2022-11-20 09:27:34,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:34,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315359105] [2022-11-20 09:27:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:27:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:27:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 09:27:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:27:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 09:27:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-20 09:27:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-20 09:27:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 09:27:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-20 09:27:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-20 09:27:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315359105] [2022-11-20 09:27:34,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315359105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:34,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533608128] [2022-11-20 09:27:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:34,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:34,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:34,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:27:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 1823 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:27:35,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-20 09:27:35,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:35,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533608128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:35,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-20 09:27:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714863522] [2022-11-20 09:27:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:35,811 INFO L87 Difference]: Start difference. First operand 945 states and 1237 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-20 09:27:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:36,639 INFO L93 Difference]: Finished difference Result 2799 states and 3674 transitions. [2022-11-20 09:27:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 205 [2022-11-20 09:27:36,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:36,653 INFO L225 Difference]: With dead ends: 2799 [2022-11-20 09:27:36,653 INFO L226 Difference]: Without dead ends: 2791 [2022-11-20 09:27:36,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:36,656 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 412 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:36,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1065 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:27:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2022-11-20 09:27:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2777. [2022-11-20 09:27:37,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2777 states, 2187 states have (on average 1.2610882487425696) internal successors, (2758), 2203 states have internal predecessors, (2758), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 437 states have call predecessors, (477), 417 states have call successors, (477) [2022-11-20 09:27:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2777 states to 2777 states and 3653 transitions. [2022-11-20 09:27:37,304 INFO L78 Accepts]: Start accepts. Automaton has 2777 states and 3653 transitions. Word has length 205 [2022-11-20 09:27:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,305 INFO L495 AbstractCegarLoop]: Abstraction has 2777 states and 3653 transitions. [2022-11-20 09:27:37,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-20 09:27:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2777 states and 3653 transitions. [2022-11-20 09:27:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-20 09:27:37,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:37,311 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:27:37,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:37,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 09:27:37,520 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,521 INFO L85 PathProgramCache]: Analyzing trace with hash 727309709, now seen corresponding path program 1 times [2022-11-20 09:27:37,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:37,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191320326] [2022-11-20 09:27:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:27:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:27:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 09:27:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:27:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 09:27:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-20 09:27:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-20 09:27:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 09:27:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-20 09:27:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-20 09:27:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:37,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191320326] [2022-11-20 09:27:37,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191320326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:37,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:37,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:37,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121008669] [2022-11-20 09:27:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:37,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:37,977 INFO L87 Difference]: Start difference. First operand 2777 states and 3653 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-20 09:27:40,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:40,353 INFO L93 Difference]: Finished difference Result 8919 states and 11788 transitions. [2022-11-20 09:27:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:27:40,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 205 [2022-11-20 09:27:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:40,413 INFO L225 Difference]: With dead ends: 8919 [2022-11-20 09:27:40,413 INFO L226 Difference]: Without dead ends: 6161 [2022-11-20 09:27:40,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:27:40,421 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 572 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:40,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1291 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:27:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6161 states. [2022-11-20 09:27:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6161 to 2789. [2022-11-20 09:27:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2789 states, 2199 states have (on average 1.259663483401546) internal successors, (2770), 2219 states have internal predecessors, (2770), 418 states have call successors, (418), 160 states have call predecessors, (418), 171 states have return successors, (477), 433 states have call predecessors, (477), 417 states have call successors, (477) [2022-11-20 09:27:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 3665 transitions. [2022-11-20 09:27:41,174 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 3665 transitions. Word has length 205 [2022-11-20 09:27:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:41,178 INFO L495 AbstractCegarLoop]: Abstraction has 2789 states and 3665 transitions. [2022-11-20 09:27:41,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-20 09:27:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 3665 transitions. [2022-11-20 09:27:41,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-20 09:27:41,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:41,186 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:27:41,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:27:41,186 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1660857439, now seen corresponding path program 1 times [2022-11-20 09:27:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:41,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816897381] [2022-11-20 09:27:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:42,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:27:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:27:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-20 09:27:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:27:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 09:27:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-20 09:27:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-20 09:27:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 09:27:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-20 09:27:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-20 09:27:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-20 09:27:42,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816897381] [2022-11-20 09:27:42,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816897381] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944195213] [2022-11-20 09:27:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:42,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:42,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:42,785 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:42,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:27:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-20 09:27:43,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:43,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:27:43,546 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 7 treesize of output 6 [2022-11-20 09:27:44,094 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1036 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1036))) is different from true [2022-11-20 09:27:44,157 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 6 treesize of output 5 [2022-11-20 09:27:44,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:27:44,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:27:44,207 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:27:44,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:27:45,774 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 13 treesize of output 15 [2022-11-20 09:27:46,008 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 13 treesize of output 15 [2022-11-20 09:27:46,024 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 13 treesize of output 15 [2022-11-20 09:27:46,270 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 13 treesize of output 15 [2022-11-20 09:27:46,283 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 13 treesize of output 15 [2022-11-20 09:27:46,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:27:46,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:27:46,349 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 40 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-11-20 09:27:46,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:46,394 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1047 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:27:48,419 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1047 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:27:48,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944195213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:48,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:27:48,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-11-20 09:27:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891302198] [2022-11-20 09:27:48,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:48,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-20 09:27:48,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:48,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-20 09:27:48,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=12, NotChecked=234, Total=1806 [2022-11-20 09:27:48,451 INFO L87 Difference]: Start difference. First operand 2789 states and 3665 transitions. Second operand has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-20 09:27:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:53,393 INFO L93 Difference]: Finished difference Result 7773 states and 10432 transitions. [2022-11-20 09:27:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-20 09:27:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) Word has length 212 [2022-11-20 09:27:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:53,421 INFO L225 Difference]: With dead ends: 7773 [2022-11-20 09:27:53,422 INFO L226 Difference]: Without dead ends: 5003 [2022-11-20 09:27:53,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 269 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1258 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=284, Invalid=3739, Unknown=21, NotChecked=378, Total=4422 [2022-11-20 09:27:53,432 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 503 mSDsluCounter, 9328 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 9778 SdHoareTripleChecker+Invalid, 3974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1423 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:53,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 9778 Invalid, 3974 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [121 Valid, 2430 Invalid, 0 Unknown, 1423 Unchecked, 2.6s Time] [2022-11-20 09:27:53,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5003 states. [2022-11-20 09:27:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5003 to 3463. [2022-11-20 09:27:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3463 states, 2778 states have (on average 1.2667386609071274) internal successors, (3519), 2794 states have internal predecessors, (3519), 475 states have call successors, (475), 182 states have call predecessors, (475), 209 states have return successors, (590), 510 states have call predecessors, (590), 474 states have call successors, (590) [2022-11-20 09:27:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4584 transitions. [2022-11-20 09:27:54,190 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4584 transitions. Word has length 212 [2022-11-20 09:27:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:54,191 INFO L495 AbstractCegarLoop]: Abstraction has 3463 states and 4584 transitions. [2022-11-20 09:27:54,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.5) internal successors, (247), 28 states have internal predecessors, (247), 13 states have call successors, (39), 10 states have call predecessors, (39), 12 states have return successors, (39), 17 states have call predecessors, (39), 13 states have call successors, (39) [2022-11-20 09:27:54,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4584 transitions. [2022-11-20 09:27:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-11-20 09:27:54,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:54,202 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:27:54,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:54,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:54,413 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:54,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1154314915, now seen corresponding path program 2 times [2022-11-20 09:27:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:54,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410082556] [2022-11-20 09:27:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:27:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:27:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:27:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:27:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:27:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 09:27:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-20 09:27:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 09:27:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:27:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 09:27:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-11-20 09:27:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 09:27:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-20 09:27:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-20 09:27:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-20 09:27:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410082556] [2022-11-20 09:27:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410082556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372583749] [2022-11-20 09:27:55,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:27:55,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:55,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:55,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:27:56,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:27:56,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:27:56,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 09:27:56,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:56,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:27:56,697 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 7 treesize of output 6 [2022-11-20 09:27:57,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:27:57,242 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1330 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1330))) is different from true [2022-11-20 09:27:57,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:27:57,382 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 6 treesize of output 5 [2022-11-20 09:27:57,479 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-20 09:27:57,480 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 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-20 09:27:57,506 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:27:57,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:27:57,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:27:57,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:27:58,164 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:27:58,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:27:58,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-20 09:27:59,631 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 09:27:59,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 09:28:00,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:01,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:01,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:01,729 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 13 treesize of output 15 [2022-11-20 09:28:01,744 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 13 treesize of output 15 [2022-11-20 09:28:01,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:28:01,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:28:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 42 proven. 74 refuted. 0 times theorem prover too weak. 17 trivial. 2 not checked. [2022-11-20 09:28:01,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:28:01,954 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1342 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1342) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:28:01,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372583749] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:01,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:28:01,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 48] total 59 [2022-11-20 09:28:01,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045167611] [2022-11-20 09:28:01,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:28:01,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-20 09:28:01,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:01,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-20 09:28:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3211, Unknown=3, NotChecked=230, Total=3660 [2022-11-20 09:28:01,988 INFO L87 Difference]: Start difference. First operand 3463 states and 4584 transitions. Second operand has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) [2022-11-20 09:28:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:07,209 INFO L93 Difference]: Finished difference Result 8539 states and 11517 transitions. [2022-11-20 09:28:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 09:28:07,210 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) Word has length 218 [2022-11-20 09:28:07,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:07,233 INFO L225 Difference]: With dead ends: 8539 [2022-11-20 09:28:07,233 INFO L226 Difference]: Without dead ends: 5625 [2022-11-20 09:28:07,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 263 SyntacticMatches, 15 SemanticMatches, 88 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2289 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=412, Invalid=7247, Unknown=5, NotChecked=346, Total=8010 [2022-11-20 09:28:07,245 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 768 mSDsluCounter, 11590 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 12029 SdHoareTripleChecker+Invalid, 4983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3016 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:07,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 12029 Invalid, 4983 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [109 Valid, 1858 Invalid, 0 Unknown, 3016 Unchecked, 2.0s Time] [2022-11-20 09:28:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2022-11-20 09:28:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 3747. [2022-11-20 09:28:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3747 states, 3013 states have (on average 1.2711583139727847) internal successors, (3830), 3037 states have internal predecessors, (3830), 502 states have call successors, (502), 198 states have call predecessors, (502), 231 states have return successors, (631), 535 states have call predecessors, (631), 501 states have call successors, (631) [2022-11-20 09:28:08,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3747 states to 3747 states and 4963 transitions. [2022-11-20 09:28:08,124 INFO L78 Accepts]: Start accepts. Automaton has 3747 states and 4963 transitions. Word has length 218 [2022-11-20 09:28:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:08,125 INFO L495 AbstractCegarLoop]: Abstraction has 3747 states and 4963 transitions. [2022-11-20 09:28:08,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 56 states have (on average 4.678571428571429) internal successors, (262), 42 states have internal predecessors, (262), 15 states have call successors, (42), 12 states have call predecessors, (42), 16 states have return successors, (42), 21 states have call predecessors, (42), 15 states have call successors, (42) [2022-11-20 09:28:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3747 states and 4963 transitions. [2022-11-20 09:28:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-20 09:28:08,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:08,138 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:28:08,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:08,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 09:28:08,349 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:08,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 612785951, now seen corresponding path program 1 times [2022-11-20 09:28:08,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:08,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977719270] [2022-11-20 09:28:08,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:28:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:28:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:28:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:28:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:28:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:28:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:28:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 09:28:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-20 09:28:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 09:28:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-20 09:28:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-11-20 09:28:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-20 09:28:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-20 09:28:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-20 09:28:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-11-20 09:28:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977719270] [2022-11-20 09:28:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977719270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370743334] [2022-11-20 09:28:10,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:10,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:10,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:10,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:10,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:28:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:10,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 1888 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-20 09:28:10,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:10,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:28:10,961 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 7 treesize of output 6 [2022-11-20 09:28:11,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:28:11,473 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1633 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1633))) is different from true [2022-11-20 09:28:11,542 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 6 treesize of output 5 [2022-11-20 09:28:11,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:28:11,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:28:11,585 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 13 treesize of output 15 [2022-11-20 09:28:11,606 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:28:11,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:28:11,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:28:11,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:28:12,070 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:28:12,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:28:13,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:28:13,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:28:13,670 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 09:28:13,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 09:28:13,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:28:14,525 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 09:28:14,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:28:15,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:15,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:15,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:15,736 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 13 treesize of output 15 [2022-11-20 09:28:15,821 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 13 treesize of output 15 [2022-11-20 09:28:15,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:28:15,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:28:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 44 proven. 78 refuted. 9 times theorem prover too weak. 28 trivial. 2 not checked. [2022-11-20 09:28:15,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:28:15,934 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1645) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:28:15,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370743334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:15,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:28:15,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 49] total 56 [2022-11-20 09:28:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884889495] [2022-11-20 09:28:15,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:28:15,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 09:28:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:15,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 09:28:15,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2705, Unknown=29, NotChecked=214, Total=3192 [2022-11-20 09:28:15,963 INFO L87 Difference]: Start difference. First operand 3747 states and 4963 transitions. Second operand has 56 states, 52 states have (on average 4.961538461538462) internal successors, (258), 42 states have internal predecessors, (258), 17 states have call successors, (42), 13 states have call predecessors, (42), 16 states have return successors, (42), 20 states have call predecessors, (42), 17 states have call successors, (42) [2022-11-20 09:28:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:22,025 INFO L93 Difference]: Finished difference Result 9523 states and 12930 transitions. [2022-11-20 09:28:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-20 09:28:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 4.961538461538462) internal successors, (258), 42 states have internal predecessors, (258), 17 states have call successors, (42), 13 states have call predecessors, (42), 16 states have return successors, (42), 20 states have call predecessors, (42), 17 states have call successors, (42) Word has length 224 [2022-11-20 09:28:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:22,055 INFO L225 Difference]: With dead ends: 9523 [2022-11-20 09:28:22,055 INFO L226 Difference]: Without dead ends: 6609 [2022-11-20 09:28:22,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 271 SyntacticMatches, 13 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2176 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=429, Invalid=5703, Unknown=38, NotChecked=310, Total=6480 [2022-11-20 09:28:22,067 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 953 mSDsluCounter, 12882 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 13366 SdHoareTripleChecker+Invalid, 7626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4359 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:22,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 13366 Invalid, 7626 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [179 Valid, 3088 Invalid, 0 Unknown, 4359 Unchecked, 3.5s Time] [2022-11-20 09:28:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6609 states. [2022-11-20 09:28:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6609 to 4105. [2022-11-20 09:28:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 3311 states have (on average 1.2684989429175475) internal successors, (4200), 3331 states have internal predecessors, (4200), 542 states have call successors, (542), 214 states have call predecessors, (542), 251 states have return successors, (685), 585 states have call predecessors, (685), 541 states have call successors, (685) [2022-11-20 09:28:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5427 transitions. [2022-11-20 09:28:23,178 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5427 transitions. Word has length 224 [2022-11-20 09:28:23,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:23,178 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 5427 transitions. [2022-11-20 09:28:23,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 4.961538461538462) internal successors, (258), 42 states have internal predecessors, (258), 17 states have call successors, (42), 13 states have call predecessors, (42), 16 states have return successors, (42), 20 states have call predecessors, (42), 17 states have call successors, (42) [2022-11-20 09:28:23,180 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5427 transitions. [2022-11-20 09:28:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-11-20 09:28:23,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:23,190 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:28:23,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:23,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 09:28:23,402 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1943002350, now seen corresponding path program 1 times [2022-11-20 09:28:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:23,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393855919] [2022-11-20 09:28:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:28:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:28:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:28:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:28:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:28:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:28:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:28:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 09:28:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-20 09:28:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 09:28:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 09:28:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-20 09:28:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-20 09:28:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-20 09:28:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 09:28:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-11-20 09:28:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:24,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393855919] [2022-11-20 09:28:24,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393855919] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:24,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:24,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:28:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104985008] [2022-11-20 09:28:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:28:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:28:24,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:28:24,376 INFO L87 Difference]: Start difference. First operand 4105 states and 5427 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-20 09:28:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:25,605 INFO L93 Difference]: Finished difference Result 7079 states and 9307 transitions. [2022-11-20 09:28:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 09:28:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 231 [2022-11-20 09:28:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:25,624 INFO L225 Difference]: With dead ends: 7079 [2022-11-20 09:28:25,624 INFO L226 Difference]: Without dead ends: 4105 [2022-11-20 09:28:25,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:28:25,636 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 96 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:25,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1130 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:28:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2022-11-20 09:28:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4105. [2022-11-20 09:28:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 3311 states have (on average 1.2684989429175475) internal successors, (4200), 3331 states have internal predecessors, (4200), 542 states have call successors, (542), 214 states have call predecessors, (542), 251 states have return successors, (673), 585 states have call predecessors, (673), 541 states have call successors, (673) [2022-11-20 09:28:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5415 transitions. [2022-11-20 09:28:26,387 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5415 transitions. Word has length 231 [2022-11-20 09:28:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:26,388 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 5415 transitions. [2022-11-20 09:28:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 4 states have internal predecessors, (131), 2 states have call successors, (19), 6 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-20 09:28:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5415 transitions. [2022-11-20 09:28:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-11-20 09:28:26,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:26,402 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:26,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:28:26,402 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:26,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1885645234, now seen corresponding path program 1 times [2022-11-20 09:28:26,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:26,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378210334] [2022-11-20 09:28:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:28:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:28:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:28:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:28:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:28:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 09:28:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:28:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-20 09:28:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-20 09:28:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 09:28:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-11-20 09:28:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-11-20 09:28:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:28:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-20 09:28:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-20 09:28:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 09:28:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 7 proven. 73 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-20 09:28:33,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:33,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378210334] [2022-11-20 09:28:33,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378210334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:33,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896298433] [2022-11-20 09:28:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:33,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:33,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:33,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:34,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:28:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:34,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 1955 conjuncts, 149 conjunts are in the unsatisfiable core [2022-11-20 09:28:34,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:34,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:28:34,828 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 7 treesize of output 6 [2022-11-20 09:28:35,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:28:35,536 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2125 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2125))) is different from true [2022-11-20 09:28:35,760 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 6 treesize of output 5 [2022-11-20 09:28:35,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:28:35,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:28:35,803 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 13 treesize of output 15 [2022-11-20 09:28:35,821 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 09:28:35,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-20 09:28:35,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:28:36,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:28:36,635 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:28:36,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:28:38,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:28:38,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:28:39,291 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 09:28:39,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 09:28:39,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:28:40,602 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 09:28:40,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:28:41,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:41,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:41,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:42,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:28:42,477 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 13 treesize of output 15 [2022-11-20 09:28:42,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 13 treesize of output 15 [2022-11-20 09:28:42,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:28:42,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:28:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 86 proven. 98 refuted. 4 times theorem prover too weak. 42 trivial. 2 not checked. [2022-11-20 09:28:42,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:28:42,668 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2139 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2139) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:28:42,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896298433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:42,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:28:42,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 50] total 86 [2022-11-20 09:28:42,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10244745] [2022-11-20 09:28:42,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:28:42,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-11-20 09:28:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-11-20 09:28:42,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=6743, Unknown=15, NotChecked=334, Total=7482 [2022-11-20 09:28:42,700 INFO L87 Difference]: Start difference. First operand 4105 states and 5415 transitions. Second operand has 86 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 68 states have internal predecessors, (276), 27 states have call successors, (47), 13 states have call predecessors, (47), 23 states have return successors, (48), 33 states have call predecessors, (48), 27 states have call successors, (48) [2022-11-20 09:28:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:54,277 INFO L93 Difference]: Finished difference Result 8948 states and 11898 transitions. [2022-11-20 09:28:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-20 09:28:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 68 states have internal predecessors, (276), 27 states have call successors, (47), 13 states have call predecessors, (47), 23 states have return successors, (48), 33 states have call predecessors, (48), 27 states have call successors, (48) Word has length 237 [2022-11-20 09:28:54,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:54,300 INFO L225 Difference]: With dead ends: 8948 [2022-11-20 09:28:54,300 INFO L226 Difference]: Without dead ends: 5998 [2022-11-20 09:28:54,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 305 SyntacticMatches, 15 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5522 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=837, Invalid=15147, Unknown=26, NotChecked=502, Total=16512 [2022-11-20 09:28:54,315 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 1813 mSDsluCounter, 10867 mSDsCounter, 0 mSdLazyCounter, 5133 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 11307 SdHoareTripleChecker+Invalid, 7413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 5133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1708 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:54,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 11307 Invalid, 7413 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [572 Valid, 5133 Invalid, 0 Unknown, 1708 Unchecked, 6.6s Time] [2022-11-20 09:28:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2022-11-20 09:28:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 4321. [2022-11-20 09:28:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4321 states, 3473 states have (on average 1.2663403397638928) internal successors, (4398), 3499 states have internal predecessors, (4398), 572 states have call successors, (572), 230 states have call predecessors, (572), 275 states have return successors, (713), 615 states have call predecessors, (713), 571 states have call successors, (713) [2022-11-20 09:28:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5683 transitions. [2022-11-20 09:28:55,444 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5683 transitions. Word has length 237 [2022-11-20 09:28:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:55,445 INFO L495 AbstractCegarLoop]: Abstraction has 4321 states and 5683 transitions. [2022-11-20 09:28:55,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 68 states have internal predecessors, (276), 27 states have call successors, (47), 13 states have call predecessors, (47), 23 states have return successors, (48), 33 states have call predecessors, (48), 27 states have call successors, (48) [2022-11-20 09:28:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5683 transitions. [2022-11-20 09:28:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2022-11-20 09:28:55,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:55,459 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:55,476 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:55,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:55,671 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1780568094, now seen corresponding path program 1 times [2022-11-20 09:28:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:55,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550865692] [2022-11-20 09:28:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:29:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:29:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:29:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:29:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 09:29:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 09:29:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:29:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:01,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 09:29:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:02,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:02,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:02,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:29:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 09:29:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 09:29:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 09:29:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-20 09:29:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 09:29:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-20 09:29:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-20 09:29:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:03,191 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-20 09:29:03,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:03,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550865692] [2022-11-20 09:29:03,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550865692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:03,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077694453] [2022-11-20 09:29:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:03,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:03,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:03,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:29:03,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 09:29:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:04,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-20 09:29:04,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:04,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:29:04,151 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 7 treesize of output 6 [2022-11-20 09:29:04,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:29:04,802 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2442 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2442) |c_#memory_int|)) is different from true [2022-11-20 09:29:05,008 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 6 treesize of output 5 [2022-11-20 09:29:05,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:29:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:05,048 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 13 treesize of output 15 [2022-11-20 09:29:05,068 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 09:29:05,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-20 09:29:05,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:29:05,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:29:05,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:29:06,151 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:29:06,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:29:07,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:29:07,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:29:08,853 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 09:29:08,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 09:29:09,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:29:10,252 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 09:29:10,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:29:11,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:11,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:11,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:12,037 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 13 treesize of output 15 [2022-11-20 09:29:12,158 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 13 treesize of output 15 [2022-11-20 09:29:12,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:12,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:29:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 92 proven. 111 refuted. 4 times theorem prover too weak. 49 trivial. 2 not checked. [2022-11-20 09:29:12,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:29:12,220 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2455 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2455) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:29:14,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2455 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2455) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:29:14,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077694453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:14,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:29:14,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 49] total 85 [2022-11-20 09:29:14,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115536048] [2022-11-20 09:29:14,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:29:14,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-20 09:29:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-20 09:29:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=6579, Unknown=18, NotChecked=498, Total=7482 [2022-11-20 09:29:14,256 INFO L87 Difference]: Start difference. First operand 4321 states and 5683 transitions. Second operand has 85 states, 81 states have (on average 3.4814814814814814) internal successors, (282), 67 states have internal predecessors, (282), 28 states have call successors, (47), 13 states have call predecessors, (47), 25 states have return successors, (50), 35 states have call predecessors, (50), 28 states have call successors, (50) [2022-11-20 09:29:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:23,827 INFO L93 Difference]: Finished difference Result 8941 states and 11855 transitions. [2022-11-20 09:29:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-11-20 09:29:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 81 states have (on average 3.4814814814814814) internal successors, (282), 67 states have internal predecessors, (282), 28 states have call successors, (47), 13 states have call predecessors, (47), 25 states have return successors, (50), 35 states have call predecessors, (50), 28 states have call successors, (50) Word has length 243 [2022-11-20 09:29:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:23,849 INFO L225 Difference]: With dead ends: 8941 [2022-11-20 09:29:23,850 INFO L226 Difference]: Without dead ends: 5991 [2022-11-20 09:29:23,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 306 SyntacticMatches, 17 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4628 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=708, Invalid=11931, Unknown=29, NotChecked=672, Total=13340 [2022-11-20 09:29:23,861 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 1149 mSDsluCounter, 9442 mSDsCounter, 0 mSdLazyCounter, 5090 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 9786 SdHoareTripleChecker+Invalid, 7295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 5090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2051 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:23,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 9786 Invalid, 7295 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [154 Valid, 5090 Invalid, 0 Unknown, 2051 Unchecked, 5.7s Time] [2022-11-20 09:29:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2022-11-20 09:29:24,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 4609. [2022-11-20 09:29:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 3689 states have (on average 1.2653835727839522) internal successors, (4668), 3725 states have internal predecessors, (4668), 616 states have call successors, (616), 248 states have call predecessors, (616), 303 states have return successors, (773), 663 states have call predecessors, (773), 615 states have call successors, (773) [2022-11-20 09:29:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 6057 transitions. [2022-11-20 09:29:24,739 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 6057 transitions. Word has length 243 [2022-11-20 09:29:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:24,740 INFO L495 AbstractCegarLoop]: Abstraction has 4609 states and 6057 transitions. [2022-11-20 09:29:24,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 81 states have (on average 3.4814814814814814) internal successors, (282), 67 states have internal predecessors, (282), 28 states have call successors, (47), 13 states have call predecessors, (47), 25 states have return successors, (50), 35 states have call predecessors, (50), 28 states have call successors, (50) [2022-11-20 09:29:24,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 6057 transitions. [2022-11-20 09:29:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-20 09:29:24,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:24,755 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:24,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:29:24,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:24,967 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:29:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1842843499, now seen corresponding path program 1 times [2022-11-20 09:29:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:24,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864626615] [2022-11-20 09:29:24,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:28,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:28,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:29:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:28,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:29:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:29:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:29:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 09:29:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 09:29:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:29:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 09:29:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:29:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 09:29:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 09:29:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-20 09:29:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-20 09:29:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-20 09:29:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 09:29:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 09:29:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 11 proven. 84 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-20 09:29:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:30,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864626615] [2022-11-20 09:29:30,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864626615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:30,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078144778] [2022-11-20 09:29:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:30,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:30,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:30,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:29:30,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 09:29:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:31,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 1984 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-20 09:29:31,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:31,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:29:31,505 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 7 treesize of output 6 [2022-11-20 09:29:32,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:29:32,043 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2770 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2770) |c_#memory_int|)) is different from true [2022-11-20 09:29:32,218 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 6 treesize of output 5 [2022-11-20 09:29:32,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:29:32,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:32,263 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 13 treesize of output 15 [2022-11-20 09:29:32,284 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 09:29:32,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-20 09:29:32,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:29:32,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:29:32,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:29:33,174 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:29:33,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:29:34,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:29:34,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:29:35,281 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 09:29:35,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 09:29:35,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 09:29:36,400 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 09:29:36,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 09:29:37,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:37,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:37,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:37,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:29:37,939 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 13 treesize of output 15 [2022-11-20 09:29:38,022 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 13 treesize of output 15 [2022-11-20 09:29:38,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:38,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:29:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 92 proven. 120 refuted. 0 times theorem prover too weak. 45 trivial. 2 not checked. [2022-11-20 09:29:38,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:29:38,082 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2783 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2783) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:29:38,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078144778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:38,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:29:38,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 48] total 78 [2022-11-20 09:29:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657801760] [2022-11-20 09:29:38,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:29:38,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-20 09:29:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:29:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-20 09:29:38,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=5465, Unknown=14, NotChecked=302, Total=6162 [2022-11-20 09:29:38,104 INFO L87 Difference]: Start difference. First operand 4609 states and 6057 transitions. Second operand has 78 states, 74 states have (on average 3.7837837837837838) internal successors, (280), 61 states have internal predecessors, (280), 26 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 32 states have call predecessors, (49), 26 states have call successors, (49) [2022-11-20 09:29:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:29:46,899 INFO L93 Difference]: Finished difference Result 9267 states and 12257 transitions. [2022-11-20 09:29:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-20 09:29:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 3.7837837837837838) internal successors, (280), 61 states have internal predecessors, (280), 26 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 32 states have call predecessors, (49), 26 states have call successors, (49) Word has length 244 [2022-11-20 09:29:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:29:46,924 INFO L225 Difference]: With dead ends: 9267 [2022-11-20 09:29:46,924 INFO L226 Difference]: Without dead ends: 6317 [2022-11-20 09:29:46,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 305 SyntacticMatches, 20 SemanticMatches, 98 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3880 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=625, Invalid=8865, Unknown=24, NotChecked=386, Total=9900 [2022-11-20 09:29:46,936 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 1100 mSDsluCounter, 9228 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 9576 SdHoareTripleChecker+Invalid, 6413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1731 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:29:46,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 9576 Invalid, 6413 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [322 Valid, 4360 Invalid, 0 Unknown, 1731 Unchecked, 5.4s Time] [2022-11-20 09:29:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2022-11-20 09:29:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 4873. [2022-11-20 09:29:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 3869 states have (on average 1.2582062548462134) internal successors, (4868), 3921 states have internal predecessors, (4868), 656 states have call successors, (656), 278 states have call predecessors, (656), 347 states have return successors, (841), 699 states have call predecessors, (841), 655 states have call successors, (841) [2022-11-20 09:29:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 6365 transitions. [2022-11-20 09:29:48,195 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 6365 transitions. Word has length 244 [2022-11-20 09:29:48,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:29:48,195 INFO L495 AbstractCegarLoop]: Abstraction has 4873 states and 6365 transitions. [2022-11-20 09:29:48,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 3.7837837837837838) internal successors, (280), 61 states have internal predecessors, (280), 26 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 32 states have call predecessors, (49), 26 states have call successors, (49) [2022-11-20 09:29:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 6365 transitions. [2022-11-20 09:29:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-20 09:29:48,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:29:48,213 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:29:48,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 09:29:48,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 09:29:48,429 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:29:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:29:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2025569299, now seen corresponding path program 1 times [2022-11-20 09:29:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:29:48,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862803461] [2022-11-20 09:29:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:48,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:29:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:29:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-20 09:29:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 09:29:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:29:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-20 09:29:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 09:29:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:29:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:52,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 09:29:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:29:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:29:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 09:29:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-20 09:29:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-20 09:29:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-20 09:29:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 09:29:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-11-20 09:29:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-20 09:29:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 09:29:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 9 proven. 88 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-20 09:29:53,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:29:53,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862803461] [2022-11-20 09:29:53,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862803461] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:29:53,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187192505] [2022-11-20 09:29:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:29:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:29:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:29:53,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:29:53,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 09:29:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:29:54,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 1983 conjuncts, 153 conjunts are in the unsatisfiable core [2022-11-20 09:29:54,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:29:54,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:29:54,807 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 7 treesize of output 6 [2022-11-20 09:29:55,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:29:55,427 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3099 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_3099))) is different from true [2022-11-20 09:29:55,625 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 6 treesize of output 5 [2022-11-20 09:29:55,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2022-11-20 09:29:55,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:29:55,653 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 13 treesize of output 15 [2022-11-20 09:29:55,668 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-20 09:29:55,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-20 09:29:55,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:29:55,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-20 09:29:56,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:29:56,498 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:29:56,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:29:57,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-20 09:29:57,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-20 09:29:58,716 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 09:29:58,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 09:29:59,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-20 09:30:00,004 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 09:30:00,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 09:30:00,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:30:01,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:30:01,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:30:01,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-20 09:30:01,818 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 13 treesize of output 15 [2022-11-20 09:30:01,929 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 13 treesize of output 15 [2022-11-20 09:30:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:30:01,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2022-11-20 09:30:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 92 proven. 120 refuted. 0 times theorem prover too weak. 45 trivial. 2 not checked. [2022-11-20 09:30:01,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:30:01,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3111 (Array Int Int)) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_3111) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|) (+ 16 |ULTIMATE.start_usb_acecad_probe_~id#1.offset|)) 0)) is different from false [2022-11-20 09:30:02,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187192505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:30:02,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:30:02,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 84 [2022-11-20 09:30:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069254566] [2022-11-20 09:30:02,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:30:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-20 09:30:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:30:02,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-20 09:30:02,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=6417, Unknown=11, NotChecked=326, Total=7140 [2022-11-20 09:30:02,006 INFO L87 Difference]: Start difference. First operand 4873 states and 6365 transitions. Second operand has 84 states, 80 states have (on average 3.5125) internal successors, (281), 66 states have internal predecessors, (281), 26 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 33 states have call predecessors, (49), 26 states have call successors, (49) [2022-11-20 09:30:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:30:17,227 INFO L93 Difference]: Finished difference Result 10126 states and 13472 transitions. [2022-11-20 09:30:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-11-20 09:30:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 80 states have (on average 3.5125) internal successors, (281), 66 states have internal predecessors, (281), 26 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 33 states have call predecessors, (49), 26 states have call successors, (49) Word has length 244 [2022-11-20 09:30:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:30:17,249 INFO L225 Difference]: With dead ends: 10126 [2022-11-20 09:30:17,250 INFO L226 Difference]: Without dead ends: 7176 [2022-11-20 09:30:17,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 308 SyntacticMatches, 19 SemanticMatches, 126 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5466 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=868, Invalid=14869, Unknown=21, NotChecked=498, Total=16256 [2022-11-20 09:30:17,261 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 1582 mSDsluCounter, 15322 mSDsCounter, 0 mSdLazyCounter, 8953 mSolverCounterSat, 625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 15825 SdHoareTripleChecker+Invalid, 14009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Valid, 8953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4431 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:30:17,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 15825 Invalid, 14009 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [625 Valid, 8953 Invalid, 0 Unknown, 4431 Unchecked, 10.3s Time] [2022-11-20 09:30:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7176 states. [2022-11-20 09:30:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7176 to 4703. [2022-11-20 09:30:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 3741 states have (on average 1.260090884790163) internal successors, (4714), 3791 states have internal predecessors, (4714), 630 states have call successors, (630), 266 states have call predecessors, (630), 331 states have return successors, (805), 671 states have call predecessors, (805), 629 states have call successors, (805) [2022-11-20 09:30:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 6149 transitions. [2022-11-20 09:30:18,474 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 6149 transitions. Word has length 244 [2022-11-20 09:30:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:30:18,475 INFO L495 AbstractCegarLoop]: Abstraction has 4703 states and 6149 transitions. [2022-11-20 09:30:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 80 states have (on average 3.5125) internal successors, (281), 66 states have internal predecessors, (281), 26 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 33 states have call predecessors, (49), 26 states have call successors, (49) [2022-11-20 09:30:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 6149 transitions. [2022-11-20 09:30:18,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-11-20 09:30:18,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:30:18,485 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 6, 6, 6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:18,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 09:30:18,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 09:30:18,696 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:30:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:30:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1851948406, now seen corresponding path program 1 times [2022-11-20 09:30:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:30:18,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976123522] [2022-11-20 09:30:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:30:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:30:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:19,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:30:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:30:20,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:30:20,609 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:30:20,611 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 09:30:20,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 09:30:20,616 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-20 09:30:20,621 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:30:21,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:30:21 BoogieIcfgContainer [2022-11-20 09:30:21,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:30:21,082 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:30:21,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:30:21,083 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:30:21,083 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:14" (3/4) ... [2022-11-20 09:30:21,086 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:30:21,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:30:21,087 INFO L158 Benchmark]: Toolchain (without parser) took 189185.58ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 112.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. [2022-11-20 09:30:21,087 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:21,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1226.85ms. Allocated memory is still 148.9MB. Free memory was 112.8MB in the beginning and 97.6MB in the end (delta: 15.1MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2022-11-20 09:30:21,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.24ms. Allocated memory is still 148.9MB. Free memory was 97.6MB in the beginning and 91.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 09:30:21,088 INFO L158 Benchmark]: Boogie Preprocessor took 124.58ms. Allocated memory is still 148.9MB. Free memory was 91.3MB in the beginning and 85.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-20 09:30:21,089 INFO L158 Benchmark]: RCFGBuilder took 1399.15ms. Allocated memory is still 148.9MB. Free memory was 85.0MB in the beginning and 69.1MB in the end (delta: 15.9MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-11-20 09:30:21,089 INFO L158 Benchmark]: TraceAbstraction took 186310.90ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 69.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 956.0MB. Max. memory is 16.1GB. [2022-11-20 09:30:21,089 INFO L158 Benchmark]: Witness Printer took 4.52ms. Allocated memory is still 1.6GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:21,091 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.18ms. Allocated memory is still 123.7MB. Free memory was 87.8MB in the beginning and 87.8MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1226.85ms. Allocated memory is still 148.9MB. Free memory was 112.8MB in the beginning and 97.6MB in the end (delta: 15.1MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.24ms. Allocated memory is still 148.9MB. Free memory was 97.6MB in the beginning and 91.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.58ms. Allocated memory is still 148.9MB. Free memory was 91.3MB in the beginning and 85.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1399.15ms. Allocated memory is still 148.9MB. Free memory was 85.0MB in the beginning and 69.1MB in the end (delta: 15.9MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * TraceAbstraction took 186310.90ms. Allocated memory was 148.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 69.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 956.0MB. Max. memory is 16.1GB. * Witness Printer took 4.52ms. Allocated memory is still 1.6GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 4063]: 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 3839, overapproximation of strlen at line 3778, overapproximation of bitwiseOr at line 3801, overapproximation of bitwiseAnd at line 3397, overapproximation of snprintf at line 3350. Possible FailurePath: [L3543] int LDV_IN_INTERRUPT = 1; [L3544] int ref_cnt ; [L3545] int ldv_state_variable_1 ; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L3548] int ldv_state_variable_0 ; [L3832-L3836] static struct usb_device_id usb_acecad_id_table[3U] = { {3U, 1120U, 4U, (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}, {3U, 1120U, 8U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 1UL}}; [L3837] struct usb_device_id const __mod_usb_device_table ; [L3838-L3843] static struct usb_driver usb_acecad_driver = {"usb_acecad", & usb_acecad_probe, & usb_acecad_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& usb_acecad_id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4066] int URB_STATE = 0; [L4067] int DEV_STATE = 0; [L4068] int INTERF_STATE = 0; [L4069] int SERIAL_STATE = 0; [L4070] void *usb_intfdata = (void *)0; [L4071] struct urb *int_urb = (struct urb *)0; [L4072] struct urb *bulk_urb = (struct urb *)0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4074] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3880] struct usb_device_id *ldvarg0 ; [L3881] void *tmp ; [L3882] int tmp___0 ; [L3883] int tmp___1 ; [L3884] int tmp___2 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] CALL, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-129127208515966861313:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=24, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-129127208515966861313:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-129127208515966861313:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-129127208515966861313:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-129127208515966861313:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-129127208515966861313:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, calloc(1UL, size)={-129127208515966861313:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-129127208515966861313:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] RET, EXPR ldv_init_zalloc(24UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-129127208515966861313:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3886] tmp = ldv_init_zalloc(24UL) [L3887] ldvarg0 = (struct usb_device_id *)tmp [L3888] FCALL ldv_initialize() [L3889] ldv_state_variable_1 = 0 [L3890] ref_cnt = 0 [L3891] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: [L3937] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3938] COND TRUE ldv_state_variable_0 == 1 [L3939] CALL, EXPR usb_acecad_init() [L3846] int result ; [L3847] int tmp ; [L3849] CALL, EXPR usb_register(& usb_acecad_driver) [L3359] int tmp ; [L3361] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3980] ldv_func_ret_type ldv_func_res ; [L3981] int tmp ; [L3983] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4343] return __VERIFIER_nondet_int(); [L3983] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3983] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3984] ldv_func_res = tmp [L3985] ldv_state_variable_1 = 1 [L3986] usb_counter = 0 [L3987] CALL ldv_usb_driver_1() [L3871] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] CALL, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3497] void *p ; [L3498] void *tmp ; [L3500] EXPR, FCALL calloc(1UL, size) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1248, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3500] tmp = calloc(1UL, size) [L3501] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3502] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, calloc(1UL, size)={-18446744073709551617:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] RET, EXPR ldv_init_zalloc(1248UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3873] tmp = ldv_init_zalloc(1248UL) [L3874] usb_acecad_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3987] RET ldv_usb_driver_1() [L3988] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, ldv_func_arg2={18446744073709551618:18446744073709551644}, ldv_func_arg2={18446744073709551618:18446744073709551644}, ldv_func_arg3={3:0}, ldv_func_arg3={3:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3361] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3362] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, driver={12:0}, driver={12:0}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3849] RET, EXPR usb_register(& usb_acecad_driver) [L3849] tmp = usb_register(& usb_acecad_driver) [L3850] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3851] COND TRUE result == 0 [L3855] return (result); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3939] RET, EXPR usb_acecad_init() [L3939] ldv_retval_1 = usb_acecad_init() [L3940] COND TRUE ldv_retval_1 == 0 [L3941] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3944] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3896] COND TRUE ldv_state_variable_1 != 0 [L3897] tmp___1 = __VERIFIER_nondet_int() [L3899] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3900] COND TRUE ldv_state_variable_1 == 1 [L3901] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3693] struct usb_device *dev ; [L3694] struct usb_device *tmp ; [L3695] struct usb_host_interface *interface ; [L3696] struct usb_endpoint_descriptor *endpoint ; [L3697] struct usb_acecad *acecad ; [L3698] struct input_dev *input_dev ; [L3699] int pipe ; [L3700] int maxp ; [L3701] int err ; [L3702] int tmp___0 ; [L3703] unsigned int tmp___1 ; [L3704] __u16 tmp___2 ; [L3705] void *tmp___3 ; [L3706] void *tmp___4 ; [L3707] size_t tmp___5 ; [L3708] size_t tmp___6 ; [L3710] CALL, EXPR interface_to_usbdev(intf) [L3971] struct usb_device *tmp ; [L3973] CALL, EXPR ldv_interface_to_usbdev() [L4189] void *result ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1822, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1822, tmp={-36893488147419103233:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] RET, EXPR ldv_malloc(sizeof(struct usb_device)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-36893488147419103233:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4194] result = ldv_malloc(sizeof(struct usb_device)) [L4195] COND FALSE !((unsigned long )result == (unsigned long )((void *)0)) [L4199] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-36893488147419103233:0}, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3973] RET, EXPR ldv_interface_to_usbdev() [L3973] tmp = ldv_interface_to_usbdev() [L3974] return (tmp); VAL [={0:0}, ={0:0}, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3710] RET, EXPR interface_to_usbdev(intf) [L3710] tmp = interface_to_usbdev(intf) [L3711] dev = tmp [L3712] EXPR intf->cur_altsetting [L3712] interface = intf->cur_altsetting [L3713] EXPR interface->desc.bNumEndpoints VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, id={-129127208515966861313:0}, id={-129127208515966861313:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, interface->desc.bNumEndpoints=-255, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3713] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3717] EXPR interface->endpoint [L3717] endpoint = & (interface->endpoint)->desc [L3718] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3314] int tmp ; [L3315] int tmp___0 ; [L3316] int tmp___1 ; [L3318] CALL, EXPR usb_endpoint_xfer_int(epd) [L3309] EXPR epd->bmAttributes [L3309] return (((int )epd->bmAttributes & 3) == 3); [L3318] RET, EXPR usb_endpoint_xfer_int(epd) [L3318] tmp = usb_endpoint_xfer_int(epd) [L3319] COND TRUE tmp != 0 [L3320] CALL, EXPR usb_endpoint_dir_in(epd) [L3303] EXPR epd->bEndpointAddress [L3303] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3320] RET, EXPR usb_endpoint_dir_in(epd) [L3320] tmp___0 = usb_endpoint_dir_in(epd) [L3321] COND TRUE tmp___0 != 0 [L3322] tmp___1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:19}, epd={18446744073709551621:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3329] return (tmp___1); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epd={18446744073709551621:19}, epd={18446744073709551621:19}, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=1, tmp___0=1, tmp___1=1, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3718] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3718] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3719] COND FALSE !(tmp___0 == 0) [L3723] EXPR endpoint->bEndpointAddress [L3723] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3383] EXPR dev->devnum [L3383] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3723] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3723] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3724] pipe = (int )(tmp___1 | 1073741952U) [L3725] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3388] struct usb_host_endpoint *ep ; [L3389] unsigned int epnum ; [L3390] int __ret_warn_on ; [L3391] long tmp ; [L3392] int __ret_warn_on___0 ; [L3393] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3395] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3396] COND TRUE is_out != 0 [L3397] __ret_warn_on = (pipe & 128) != 0 VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3398] CALL, EXPR ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3398] RET, EXPR ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, ldv__builtin_expect(__ret_warn_on != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3398] tmp = ldv__builtin_expect(__ret_warn_on != 0, 0L) [L3399] COND FALSE !(tmp != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3403] CALL ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3540] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, c=0, DEV_STATE=0, exp=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3403] RET ldv__builtin_expect(__ret_warn_on != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, ldv__builtin_expect(__ret_warn_on != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3404] EXPR udev->ep_out[epnum] [L3404] ep = udev->ep_out[epnum] [L3415] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3416] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=1, \old(pipe)=32767, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, ep={18446744073709551599:17}, epnum=0, int_urb={0:0}, INTERF_STATE=0, is_out=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3725] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3725] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3726] maxp = (int )tmp___2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] CALL, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=232, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=232, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654849:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp___1={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=208, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-55340232221128654849:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] RET, EXPR kzalloc(232UL, 208U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, kzalloc(232UL, 208U)={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3727] tmp___3 = kzalloc(232UL, 208U) [L3728] acecad = (struct usb_acecad *)tmp___3 [L3729] CALL, EXPR input_allocate_device() [L3551] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3447] void *tmp ; [L3449] CALL, EXPR kmalloc(size, flags | 32768U) [L3438] void *tmp___1 ; [L3440] CALL, EXPR __kmalloc(size, flags) [L3433] CALL, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=1855, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-73786976294838206465:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] RET, EXPR ldv_malloc(size) VAL [={0:0}, ={0:0}, \old(size)=1855, \old(t)=32768, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-73786976294838206465:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, t=32768, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3433] return ldv_malloc(size); [L3440] RET, EXPR __kmalloc(size, flags) [L3440] tmp___1 = __kmalloc(size, flags) [L3441] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=32768, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp___1={-73786976294838206465:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3449] RET, EXPR kmalloc(size, flags | 32768U) [L3449] tmp = kmalloc(size, flags | 32768U) [L3450] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, flags=128, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-73786976294838206465:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-73786976294838206465:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3551] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3729] RET, EXPR input_allocate_device() [L3729] input_dev = input_allocate_device() [L3730] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3735] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4324] CALL, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] RET, EXPR ldv_malloc(0UL) VAL [={0:0}, ={0:0}, \old(arg1)=8, \old(arg2)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0={-36893488147419103233:0}, arg0={-36893488147419103233:0}, arg1=8, arg2=208, arg3={-55340232221128654849:224}, arg3={-55340232221128654849:224}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4324] return ldv_malloc(0UL); [L3735] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3735] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3736] acecad->data = (unsigned char *)tmp___4 [L3737] EXPR acecad->data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-18446744073709551615:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3737] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3742] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4009] ldv_func_ret_type___0 ldv_func_res ; [L4010] struct urb *tmp ; [L4012] CALL, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4327] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-92233720368547758081:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758081:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(arg0)=0, \old(arg1)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0=0, arg1=208, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-92233720368547758081:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=0, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4327] return ldv_malloc(sizeof(struct urb)); [L4012] RET, EXPR usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4012] tmp = usb_alloc_urb(ldv_func_arg1, ldv_func_arg2) [L4013] ldv_func_res = tmp [L4014] CALL ldv_alloc_urb(ldv_func_res) [L4098] COND TRUE (unsigned long )res != (unsigned long )((struct urb *)0) [L4099] URB_STATE = URB_STATE + 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, res={-92233720368547758081:0}, res={-92233720368547758081:0}, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4014] RET ldv_alloc_urb(ldv_func_res) [L4015] return (ldv_func_res); VAL [={0:0}, ={0:0}, \old(ldv_func_arg1)=0, \old(ldv_func_arg2)=208, \result={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1=0, ldv_func_arg2=208, ldv_func_res={-92233720368547758081:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-92233720368547758081:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3742] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3742] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3743] EXPR acecad->irq VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->irq={-92233720368547758081:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3743] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3748] acecad->usbdev = dev [L3749] acecad->input = input_dev [L3750] EXPR dev->manufacturer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->manufacturer={18446744073709551598:18}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3750] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3754] EXPR dev->product VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->product={18446744073709551593:23}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3754] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3762] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3348] int actual ; [L3350] EXPR dev->bus [L3350] EXPR (dev->bus)->bus_name [L3350] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3351] return ((int )size > actual ? actual : -1); VAL [={0:0}, ={0:0}, \old(size)=64, \result=-1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, actual=-1, buf={-55340232221128654849:128}, buf={-55340232221128654849:128}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev={-36893488147419103233:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=64, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3762] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3763] CALL strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, \old(arg2)=64, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg0={-55340232221128654849:128}, arg1={8:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4317] return __VERIFIER_nondet_ulong(); [L3763] RET strlcat((char *)(& acecad->phys), "/input0", 64UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=18446744073709551643, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3764] input_dev->name = (char const *)(& acecad->name) [L3765] input_dev->phys = (char const *)(& acecad->phys) [L3766] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3600] id->bustype = 3U [L3601] EXPR dev->descriptor.idVendor [L3601] id->vendor = dev->descriptor.idVendor [L3602] EXPR dev->descriptor.idProduct [L3602] id->product = dev->descriptor.idProduct [L3603] EXPR dev->descriptor.bcdDevice [L3603] id->version = dev->descriptor.bcdDevice [L3766] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3767] input_dev->dev.parent = & intf->dev [L3768] CALL input_set_drvdata(input_dev, (void *)acecad) [L3565] FCALL dev_set_drvdata(& dev->dev, data) [L3768] RET input_set_drvdata(input_dev, (void *)acecad) [L3769] input_dev->open = & usb_acecad_open [L3770] input_dev->close = & usb_acecad_close [L3771] input_dev->evbit[0] = 10UL [L3772] input_dev->keybit[5] = 7169UL [L3773] id->driver_info [L3774] case 0UL: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3775] FCALL input_set_abs_params(input_dev, 0U, 0, 5000, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3776] FCALL input_set_abs_params(input_dev, 1U, 0, 3750, 4, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3777] FCALL input_set_abs_params(input_dev, 24U, 0, 512, 0, 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3778] tmp___5 = strlen((char const *)(& acecad->name)) [L3779] COND FALSE !(tmp___5 == 0UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3798] EXPR acecad->irq [L3798] EXPR acecad->data [L3799] EXPR endpoint->bInterval [L3798-L3799] CALL ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L4024] CALL ldv_fill_int_urb(complete_fn) [L4120] struct urb *value ; [L4121] int tmp___0 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3463] void *p ; [L3464] void *tmp ; [L3465] int tmp___0 ; [L3467] tmp___0 = __VERIFIER_nondet_int() [L3468] COND FALSE !(tmp___0 != 0) [L3471] tmp = malloc(size) [L3472] p = tmp VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-110680464442257309697:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3459] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, cond=1, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3473] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=180, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-110680464442257309697:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-110680464442257309697:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-110680464442257309697:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-110680464442257309697:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-110680464442257309697:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4123] value = ldv_malloc(sizeof(struct urb)) [L4124] COND FALSE !((unsigned long )value == (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-110680464442257309697:0}] [L4128] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3516] int tmp ; [L3518] tmp = __VERIFIER_nondet_int() [L3519] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4128] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_undef_int()=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-110680464442257309697:0}] [L4128] tmp___0 = ldv_undef_int() [L4129] COND FALSE !(tmp___0 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, complete_fn={-1:2}, complete_fn={-1:2}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}, value={-110680464442257309697:0}] [L4024] RET ldv_fill_int_urb(complete_fn) [L3798-L3799] RET ldv_usb_fill_int_urb_6(acecad->irq, dev, (unsigned int )pipe, (void *)acecad->data, 8 < maxp ? 8 : maxp, & usb_acecad_irq, (void *)acecad, (int )endpoint->bInterval) [L3800] EXPR acecad->irq [L3800] EXPR acecad->data_dma [L3800] (acecad->irq)->transfer_dma = acecad->data_dma [L3801] EXPR acecad->irq [L3801] EXPR acecad->irq [L3801] EXPR (acecad->irq)->transfer_flags [L3801] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3802] EXPR acecad->input [L3802] CALL, EXPR input_register_device(acecad->input) [L4300] return __VERIFIER_nondet_int(); [L3802] RET, EXPR input_register_device(acecad->input) [L3802] err = input_register_device(acecad->input) [L3803] COND TRUE err != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] EXPR acecad->data [L3810] EXPR acecad->data_dma VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-18446744073709551615:0}, acecad->data_dma=18446744073709551632, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3810] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, acecad->data={-18446744073709551615:0}, acecad->data_dma=18446744073709551632, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3812] FCALL input_free_device(input_dev) [L3813] CALL kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-55340232221128654849:0}, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3813] RET kfree((void const *)acecad) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3814] return (err); VAL [={0:0}, ={0:0}, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, acecad={-55340232221128654849:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={18446744073709551621:19}, err=1, id={-129127208515966861313:0}, id={-129127208515966861313:0}, id->driver_info=0, input_dev={-73786976294838206465:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551627:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=4194304, tmp___2=0, tmp___3={-55340232221128654849:0}, tmp___4={-18446744073709551615:0}, tmp___5=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3901] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3901] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3902] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3893] tmp___0 = __VERIFIER_nondet_int() [L3895] case 0: [L3925] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3926] COND TRUE ldv_state_variable_0 != 0 [L3927] tmp___2 = __VERIFIER_nondet_int() [L3929] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3930] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3931] CALL usb_acecad_exit() [L3861] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4054] FCALL usb_deregister(arg) [L4055] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, arg={12:0}, arg={12:0}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3861] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3931] RET usb_acecad_exit() [L3932] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={-129127208515966861313:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-129127208515966861313:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L3965] CALL ldv_check_final_state() [L4267] COND TRUE URB_STATE != 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4268] CALL ldv_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] [L4063] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={18446744073709551618:18446744073709551644}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=1, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={12:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={11:0}, usb_counter=0, usb_intfdata={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 185.8s, OverallIterations: 24, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 74.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14235 SdHoareTripleChecker+Valid, 42.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13783 mSDsluCounter, 100618 SdHoareTripleChecker+Invalid, 37.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18719 IncrementalHoareTripleChecker+Unchecked, 92067 mSDsCounter, 3650 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34564 IncrementalHoareTripleChecker+Invalid, 56933 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3650 mSolverCounterUnsat, 8551 mSDtfsCounter, 34564 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4276 GetRequests, 3315 SyntacticMatches, 117 SemanticMatches, 844 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 25379 ImplicationChecksByTransitivity, 59.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4873occurred in iteration=22, InterpolantAutomatonStates: 523, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 20729 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 85.6s InterpolantComputationTime, 6356 NumberOfCodeBlocks, 6230 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6073 ConstructedInterpolants, 587 QuantifiedInterpolants, 34058 SizeOfPredicates, 312 NumberOfNonLiveVariables, 19910 ConjunctsInSsa, 1086 ConjunctsInUnsatCore, 35 InterpolantComputations, 16 PerfectInterpolantSequences, 3170/4230 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-20 09:30:21,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:30:23,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:30:23,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:30:23,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:30:23,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:30:23,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:30:23,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:30:23,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:30:23,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:30:23,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:30:23,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:30:23,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:30:23,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:30:23,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:30:23,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:30:23,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:30:23,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:30:23,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:30:23,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:30:23,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:30:23,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:30:23,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:30:23,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:30:23,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:30:23,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:30:23,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:30:23,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:30:23,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:30:23,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:30:23,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:30:23,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:30:23,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:30:23,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:30:23,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:30:23,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:30:23,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:30:23,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:30:23,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:30:23,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:30:23,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:30:23,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:30:23,960 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-20 09:30:24,000 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:30:24,001 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:30:24,002 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:30:24,003 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:30:24,004 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:30:24,004 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:30:24,004 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:30:24,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:30:24,005 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:30:24,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:30:24,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:30:24,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:30:24,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:30:24,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:30:24,007 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:30:24,007 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:30:24,008 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:30:24,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:30:24,008 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:30:24,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:30:24,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:30:24,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:30:24,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:30:24,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:24,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:30:24,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:30:24,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:30:24,010 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:30:24,010 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:30:24,011 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:30:24,011 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:30:24,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:30:24,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:30:24,012 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_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bd4d18c7774801c1dd2fcc01cd37afd9da2c99096cf08f4bd160d17156b286b [2022-11-20 09:30:24,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:30:24,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:30:24,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:30:24,482 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:30:24,483 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:30:24,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 09:30:27,820 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:30:28,311 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:30:28,312 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_1a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-20 09:30:28,335 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data/af2d8f90b/09bae55c67d34ef58cd2712fae16401c/FLAGd75632f70 [2022-11-20 09:30:28,356 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8108ac6c-43aa-451e-8249-dca60cfc7bc6/bin/uautomizer-ug76WZFUDN/data/af2d8f90b/09bae55c67d34ef58cd2712fae16401c [2022-11-20 09:30:28,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:30:28,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:30:28,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:30:28,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:30:28,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:30:28,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:28" (1/1) ... [2022-11-20 09:30:28,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7e6ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:30:28, skipping insertion in model container [2022-11-20 09:30:28,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:30:28" (1/1) ... [2022-11-20 09:30:28,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:30:28,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:30:29,046 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350] at de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) at de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckHelper.typeCheckBinaryExpression(TypeCheckHelper.java:207) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.constructBinaryExpression(ExpressionFactory.java:617) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.newBinaryExpression(ExpressionFactory.java:132) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleSnPrintF(StandardFunctionHandler.java:959) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$21(StandardFunctionHandler.java:305) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1463) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:728) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1413) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1087) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1087) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1489) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3314) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 09:30:29,074 INFO L158 Benchmark]: Toolchain (without parser) took 712.25ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 43.9MB in the beginning and 93.3MB in the end (delta: -49.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-11-20 09:30:29,075 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 75.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:29,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 709.82ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 43.7MB in the beginning and 93.3MB in the end (delta: -49.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-11-20 09:30:29,078 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.33ms. Allocated memory is still 75.5MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 709.82ms. Allocated memory was 75.5MB in the beginning and 115.3MB in the end (delta: 39.8MB). Free memory was 43.7MB in the beginning and 93.3MB in the end (delta: -49.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350] de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350]: de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: TypeCheckException: Type check failed for C: snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [3350]