./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 8393723b 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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:35:52,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:35:52,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:35:52,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:35:52,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:35:52,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:35:52,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:35:52,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:35:52,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:35:52,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:35:52,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:35:52,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:35:52,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:35:52,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:35:52,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:35:52,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:35:52,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:35:52,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:35:52,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:35:52,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:35:52,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:35:52,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:35:52,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:35:52,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:35:52,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:35:52,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:35:52,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:35:52,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:35:52,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:35:52,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:35:52,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:35:52,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:35:52,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:35:52,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:35:52,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:35:52,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:35:52,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:35:52,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:35:52,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:35:52,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:35:52,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:35:52,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:35:52,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:35:52,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:35:52,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:35:52,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:35:52,196 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:35:52,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:35:52,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:35:52,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:35:52,197 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:35:52,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:35:52,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:35:52,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:35:52,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:35:52,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:35:52,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:35:52,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:35:52,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:35:52,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:35:52,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:35:52,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:35:52,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:35:52,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:35:52,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:35:52,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:35:52,202 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:35:52,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:35:52,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:35:52,205 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:35:52,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:35:52,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:35:52,205 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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro 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-18 20:35:52,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:35:52,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:35:52,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:35:52,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:35:52,519 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:35:52,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/../../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-18 20:35:52,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/b609d5d95/d7c1aacefbc349a887492800a49baebb/FLAG3c5681c91 [2022-11-18 20:35:53,368 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:35:53,368 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:35:53,407 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/b609d5d95/d7c1aacefbc349a887492800a49baebb/FLAG3c5681c91 [2022-11-18 20:35:53,494 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/b609d5d95/d7c1aacefbc349a887492800a49baebb [2022-11-18 20:35:53,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:35:53,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:35:53,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:35:53,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:35:53,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:35:53,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:53" (1/1) ... [2022-11-18 20:35:53,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7905e731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:53, skipping insertion in model container [2022-11-18 20:35:53,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:35:53" (1/1) ... [2022-11-18 20:35:53,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:35:53,632 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:35:54,425 WARN L234 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_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:35:54,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:35:54,489 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:35:54,641 WARN L234 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_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:35:54,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:35:54,686 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:35:54,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54 WrapperNode [2022-11-18 20:35:54,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:35:54,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:35:54,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:35:54,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:35:54,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,844 INFO L138 Inliner]: procedures = 109, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 777 [2022-11-18 20:35:54,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:35:54,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:35:54,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:35:54,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:35:54,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,957 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:35:54,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:35:54,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:35:54,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:35:54,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (1/1) ... [2022-11-18 20:35:54,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:35:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:35:55,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:35:55,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:35:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:35:55,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:35:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:35:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:35:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:35:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:35:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:35:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:35:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:35:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-18 20:35:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-18 20:35:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:35:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:35:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:35:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:35:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:35:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-18 20:35:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-18 20:35:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-18 20:35:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-18 20:35:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:35:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:35:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:35:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:35:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-18 20:35:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-18 20:35:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:35:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-18 20:35:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-18 20:35:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-18 20:35:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-18 20:35:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:35:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:35:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:35:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:35:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:35:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-18 20:35:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-18 20:35:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-18 20:35:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-18 20:35:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:35:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:35:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:35:55,487 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:35:55,490 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:35:55,589 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:35:56,400 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:35:56,410 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:35:56,410 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:35:56,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:56 BoogieIcfgContainer [2022-11-18 20:35:56,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:35:56,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:35:56,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:35:56,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:35:56,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:35:53" (1/3) ... [2022-11-18 20:35:56,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f134868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:56, skipping insertion in model container [2022-11-18 20:35:56,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:35:54" (2/3) ... [2022-11-18 20:35:56,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f134868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:35:56, skipping insertion in model container [2022-11-18 20:35:56,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:56" (3/3) ... [2022-11-18 20:35:56,425 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-18 20:35:56,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:35:56,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:35:56,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:35:56,549 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;@5c21c1c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:35:56,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:35:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 231 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 182 states have internal predecessors, (225), 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-18 20:35:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:35:56,568 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:56,569 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-18 20:35:56,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 73926003, now seen corresponding path program 1 times [2022-11-18 20:35:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:56,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016314072] [2022-11-18 20:35:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:57,089 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-18 20:35:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:57,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016314072] [2022-11-18 20:35:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016314072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:57,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:57,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:35:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519680950] [2022-11-18 20:35:57,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:57,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:35:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:57,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:35:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:35:57,132 INFO L87 Difference]: Start difference. First operand has 231 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 182 states have internal predecessors, (225), 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-18 20:35:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:57,734 INFO L93 Difference]: Finished difference Result 464 states and 632 transitions. [2022-11-18 20:35:57,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:35:57,738 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-18 20:35:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:57,753 INFO L225 Difference]: With dead ends: 464 [2022-11-18 20:35:57,753 INFO L226 Difference]: Without dead ends: 227 [2022-11-18 20:35:57,758 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-18 20:35:57,767 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 52 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:57,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 564 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:35:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-18 20:35:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 220. [2022-11-18 20:35:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 166 states have (on average 1.283132530120482) internal successors, (213), 171 states have internal predecessors, (213), 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-18 20:35:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 287 transitions. [2022-11-18 20:35:57,834 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 287 transitions. Word has length 32 [2022-11-18 20:35:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:57,835 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 287 transitions. [2022-11-18 20:35:57,835 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-18 20:35:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 287 transitions. [2022-11-18 20:35:57,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:35:57,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:57,838 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-18 20:35:57,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:35:57,838 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash 496627829, now seen corresponding path program 1 times [2022-11-18 20:35:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:57,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842015056] [2022-11-18 20:35:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:57,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:58,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:58,020 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-18 20:35:58,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:58,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842015056] [2022-11-18 20:35:58,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842015056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:58,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:58,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:35:58,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107366372] [2022-11-18 20:35:58,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:58,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:35:58,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:58,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:35:58,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:35:58,023 INFO L87 Difference]: Start difference. First operand 220 states and 287 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-18 20:35:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:35:58,828 INFO L93 Difference]: Finished difference Result 640 states and 844 transitions. [2022-11-18 20:35:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:35:58,828 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-18 20:35:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:35:58,832 INFO L225 Difference]: With dead ends: 640 [2022-11-18 20:35:58,832 INFO L226 Difference]: Without dead ends: 425 [2022-11-18 20:35:58,834 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-18 20:35:58,835 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 319 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:35:58,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 754 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:35:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-11-18 20:35:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 411. [2022-11-18 20:35:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 310 states have (on average 1.2774193548387096) internal successors, (396), 317 states have internal predecessors, (396), 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-18 20:35:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 536 transitions. [2022-11-18 20:35:58,879 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 536 transitions. Word has length 32 [2022-11-18 20:35:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:35:58,879 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 536 transitions. [2022-11-18 20:35:58,880 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-18 20:35:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 536 transitions. [2022-11-18 20:35:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:35:58,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:35:58,882 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-18 20:35:58,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:35:58,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:35:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:35:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1616459438, now seen corresponding path program 1 times [2022-11-18 20:35:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:35:58,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111029301] [2022-11-18 20:35:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:35:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:35:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:35:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:35:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:35:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:35:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:35:59,152 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-18 20:35:59,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:35:59,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111029301] [2022-11-18 20:35:59,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111029301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:35:59,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:35:59,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:35:59,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539273190] [2022-11-18 20:35:59,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:35:59,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:35:59,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:35:59,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:35:59,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:35:59,157 INFO L87 Difference]: Start difference. First operand 411 states and 536 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-18 20:36:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:00,063 INFO L93 Difference]: Finished difference Result 970 states and 1306 transitions. [2022-11-18 20:36:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:36:00,067 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-18 20:36:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:00,071 INFO L225 Difference]: With dead ends: 970 [2022-11-18 20:36:00,071 INFO L226 Difference]: Without dead ends: 574 [2022-11-18 20:36:00,073 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-18 20:36:00,074 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 611 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:00,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1424 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:36:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-11-18 20:36:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 414. [2022-11-18 20:36:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 313 states have (on average 1.2715654952076678) internal successors, (398), 320 states have internal predecessors, (398), 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-18 20:36:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 538 transitions. [2022-11-18 20:36:00,122 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 538 transitions. Word has length 55 [2022-11-18 20:36:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:00,123 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 538 transitions. [2022-11-18 20:36:00,123 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-18 20:36:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 538 transitions. [2022-11-18 20:36:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:36:00,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:00,125 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-18 20:36:00,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:36:00,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1941191186, now seen corresponding path program 1 times [2022-11-18 20:36:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:00,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655782574] [2022-11-18 20:36:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:00,363 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-18 20:36:00,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:00,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655782574] [2022-11-18 20:36:00,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655782574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:00,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:00,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614056128] [2022-11-18 20:36:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:00,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:00,377 INFO L87 Difference]: Start difference. First operand 414 states and 538 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-18 20:36:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:01,146 INFO L93 Difference]: Finished difference Result 1233 states and 1623 transitions. [2022-11-18 20:36:01,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:36:01,147 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-18 20:36:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:01,158 INFO L225 Difference]: With dead ends: 1233 [2022-11-18 20:36:01,158 INFO L226 Difference]: Without dead ends: 834 [2022-11-18 20:36:01,160 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-18 20:36:01,164 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 324 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:01,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 781 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:36:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-11-18 20:36:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 804. [2022-11-18 20:36:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 612 states have (on average 1.2663398692810457) internal successors, (775), 623 states have internal predecessors, (775), 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-18 20:36:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1045 transitions. [2022-11-18 20:36:01,265 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1045 transitions. Word has length 55 [2022-11-18 20:36:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:01,267 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1045 transitions. [2022-11-18 20:36:01,267 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-18 20:36:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1045 transitions. [2022-11-18 20:36:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:36:01,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:01,276 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-18 20:36:01,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:36:01,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:01,277 INFO L85 PathProgramCache]: Analyzing trace with hash -47375157, now seen corresponding path program 1 times [2022-11-18 20:36:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:01,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233938713] [2022-11-18 20:36:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:01,456 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-18 20:36:01,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:01,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233938713] [2022-11-18 20:36:01,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233938713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:01,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:01,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847601660] [2022-11-18 20:36:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:01,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:01,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:01,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:01,460 INFO L87 Difference]: Start difference. First operand 804 states and 1045 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-18 20:36:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:02,045 INFO L93 Difference]: Finished difference Result 834 states and 1094 transitions. [2022-11-18 20:36:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:02,046 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-18 20:36:02,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:02,052 INFO L225 Difference]: With dead ends: 834 [2022-11-18 20:36:02,052 INFO L226 Difference]: Without dead ends: 831 [2022-11-18 20:36:02,053 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-18 20:36:02,054 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 278 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:02,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 528 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:36:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-18 20:36:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 803. [2022-11-18 20:36:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 612 states have (on average 1.2647058823529411) internal successors, (774), 622 states have internal predecessors, (774), 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-18 20:36:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1043 transitions. [2022-11-18 20:36:02,138 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1043 transitions. Word has length 56 [2022-11-18 20:36:02,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:02,140 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1043 transitions. [2022-11-18 20:36:02,141 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-18 20:36:02,141 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1043 transitions. [2022-11-18 20:36:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 20:36:02,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:02,143 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-18 20:36:02,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:36:02,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1468615535, now seen corresponding path program 1 times [2022-11-18 20:36:02,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:02,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410129078] [2022-11-18 20:36:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:02,332 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-18 20:36:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:02,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410129078] [2022-11-18 20:36:02,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410129078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:02,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:02,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783385740] [2022-11-18 20:36:02,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:02,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:02,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:02,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:02,335 INFO L87 Difference]: Start difference. First operand 803 states and 1043 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-18 20:36:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:02,873 INFO L93 Difference]: Finished difference Result 833 states and 1092 transitions. [2022-11-18 20:36:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:02,875 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-18 20:36:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:02,883 INFO L225 Difference]: With dead ends: 833 [2022-11-18 20:36:02,884 INFO L226 Difference]: Without dead ends: 830 [2022-11-18 20:36:02,885 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-18 20:36:02,886 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 275 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:02,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 524 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:36:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-11-18 20:36:02,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 802. [2022-11-18 20:36:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 612 states have (on average 1.2630718954248366) internal successors, (773), 621 states have internal predecessors, (773), 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-18 20:36:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1041 transitions. [2022-11-18 20:36:02,952 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1041 transitions. Word has length 57 [2022-11-18 20:36:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:02,954 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1041 transitions. [2022-11-18 20:36:02,954 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-18 20:36:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1041 transitions. [2022-11-18 20:36:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:36:02,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:02,956 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-18 20:36:02,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:36:02,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1717577870, now seen corresponding path program 1 times [2022-11-18 20:36:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:02,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500578526] [2022-11-18 20:36:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,169 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-18 20:36:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:03,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500578526] [2022-11-18 20:36:03,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500578526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:03,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:03,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:36:03,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097115634] [2022-11-18 20:36:03,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:03,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:03,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:03,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:03,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:36:03,176 INFO L87 Difference]: Start difference. First operand 802 states and 1041 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-18 20:36:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:03,566 INFO L93 Difference]: Finished difference Result 832 states and 1090 transitions. [2022-11-18 20:36:03,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:36:03,567 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-18 20:36:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:03,571 INFO L225 Difference]: With dead ends: 832 [2022-11-18 20:36:03,572 INFO L226 Difference]: Without dead ends: 821 [2022-11-18 20:36:03,572 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-18 20:36:03,575 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 312 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:03,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 374 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:36:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-11-18 20:36:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 793. [2022-11-18 20:36:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 604 states have (on average 1.2615894039735098) internal successors, (762), 612 states have internal predecessors, (762), 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-18 20:36:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1029 transitions. [2022-11-18 20:36:03,637 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1029 transitions. Word has length 58 [2022-11-18 20:36:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:03,638 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1029 transitions. [2022-11-18 20:36:03,638 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-18 20:36:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1029 transitions. [2022-11-18 20:36:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-18 20:36:03,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:03,644 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] [2022-11-18 20:36:03,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:36:03,645 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1858038329, now seen corresponding path program 1 times [2022-11-18 20:36:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:03,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079104802] [2022-11-18 20:36:03,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:36:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-18 20:36:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-18 20:36:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-18 20:36:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 20:36:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-18 20:36:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-18 20:36:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-18 20:36:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-18 20:36:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-18 20:36:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:03,929 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-18 20:36:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:03,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079104802] [2022-11-18 20:36:03,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079104802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:03,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:03,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:36:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381073110] [2022-11-18 20:36:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:03,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:36:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:03,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:36:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:36:03,932 INFO L87 Difference]: Start difference. First operand 793 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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-18 20:36:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:04,441 INFO L93 Difference]: Finished difference Result 1663 states and 2177 transitions. [2022-11-18 20:36:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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 153 [2022-11-18 20:36:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:04,446 INFO L225 Difference]: With dead ends: 1663 [2022-11-18 20:36:04,446 INFO L226 Difference]: Without dead ends: 885 [2022-11-18 20:36:04,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:36:04,450 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 191 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:04,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 711 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:36:04,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-18 20:36:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 847. [2022-11-18 20:36:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 657 states have (on average 1.2724505327245053) internal successors, (836), 665 states have internal predecessors, (836), 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-18 20:36:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1103 transitions. [2022-11-18 20:36:04,534 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1103 transitions. Word has length 153 [2022-11-18 20:36:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:04,535 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 1103 transitions. [2022-11-18 20:36:04,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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-18 20:36:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1103 transitions. [2022-11-18 20:36:04,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-18 20:36:04,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:04,541 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] [2022-11-18 20:36:04,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:36:04,542 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:04,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -552727768, now seen corresponding path program 1 times [2022-11-18 20:36:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:04,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144110500] [2022-11-18 20:36:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:04,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-18 20:36:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-18 20:36:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-18 20:36:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-18 20:36:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-18 20:36:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:36:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:36:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:04,966 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-18 20:36:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:04,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144110500] [2022-11-18 20:36:04,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144110500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:04,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:04,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:36:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266753435] [2022-11-18 20:36:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:36:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:36:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:36:04,969 INFO L87 Difference]: Start difference. First operand 847 states and 1103 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 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-18 20:36:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:05,728 INFO L93 Difference]: Finished difference Result 2273 states and 3056 transitions. [2022-11-18 20:36:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:05,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 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 162 [2022-11-18 20:36:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:05,735 INFO L225 Difference]: With dead ends: 2273 [2022-11-18 20:36:05,736 INFO L226 Difference]: Without dead ends: 1445 [2022-11-18 20:36:05,738 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-18 20:36:05,739 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 427 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:05,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1677 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:36:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-11-18 20:36:05,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 859. [2022-11-18 20:36:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 669 states have (on average 1.2675635276532138) internal successors, (848), 677 states have internal predecessors, (848), 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-18 20:36:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1115 transitions. [2022-11-18 20:36:05,859 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1115 transitions. Word has length 162 [2022-11-18 20:36:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:05,860 INFO L495 AbstractCegarLoop]: Abstraction has 859 states and 1115 transitions. [2022-11-18 20:36:05,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 5 states have internal predecessors, (98), 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-18 20:36:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1115 transitions. [2022-11-18 20:36:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-18 20:36:05,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:05,864 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] [2022-11-18 20:36:05,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:36:05,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1711252543, now seen corresponding path program 1 times [2022-11-18 20:36:05,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:05,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659815949] [2022-11-18 20:36:05,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:05,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:36:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:36:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:36:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:36:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-18 20:36:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:36:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:36:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,353 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-18 20:36:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659815949] [2022-11-18 20:36:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659815949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164666851] [2022-11-18 20:36:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:06,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:06,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:06,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:06,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:36:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:06,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:36:06,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:06,880 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-18 20:36:06,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:06,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164666851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:06,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:36:06,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-18 20:36:06,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535443434] [2022-11-18 20:36:06,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:06,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:06,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:06,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:06,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:36:06,883 INFO L87 Difference]: Start difference. First operand 859 states and 1115 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-18 20:36:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:07,216 INFO L93 Difference]: Finished difference Result 2785 states and 3646 transitions. [2022-11-18 20:36:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:36:07,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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 164 [2022-11-18 20:36:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:07,225 INFO L225 Difference]: With dead ends: 2785 [2022-11-18 20:36:07,225 INFO L226 Difference]: Without dead ends: 1945 [2022-11-18 20:36:07,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 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-18 20:36:07,229 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 393 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1859 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-18 20:36:07,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1859 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:36:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2022-11-18 20:36:07,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 895. [2022-11-18 20:36:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 697 states have (on average 1.2568149210903874) internal successors, (876), 705 states have internal predecessors, (876), 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-18 20:36:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1159 transitions. [2022-11-18 20:36:07,339 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1159 transitions. Word has length 164 [2022-11-18 20:36:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:07,340 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 1159 transitions. [2022-11-18 20:36:07,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-18 20:36:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1159 transitions. [2022-11-18 20:36:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-18 20:36:07,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:07,344 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] [2022-11-18 20:36:07,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:07,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:07,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1572597503, now seen corresponding path program 1 times [2022-11-18 20:36:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:07,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932704596] [2022-11-18 20:36:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-18 20:36:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:36:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:36:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-18 20:36:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-18 20:36:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:36:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-18 20:36:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,306 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-18 20:36:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:08,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932704596] [2022-11-18 20:36:08,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932704596] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:08,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057989665] [2022-11-18 20:36:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:08,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:08,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:08,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:36:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:08,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 20:36:08,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:08,813 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-18 20:36:08,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:08,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057989665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:08,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:36:08,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-18 20:36:08,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87399544] [2022-11-18 20:36:08,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:08,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:36:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:36:08,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:36:08,817 INFO L87 Difference]: Start difference. First operand 895 states and 1159 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 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-18 20:36:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:08,966 INFO L93 Difference]: Finished difference Result 1799 states and 2355 transitions. [2022-11-18 20:36:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:36:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 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 164 [2022-11-18 20:36:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:08,971 INFO L225 Difference]: With dead ends: 1799 [2022-11-18 20:36:08,972 INFO L226 Difference]: Without dead ends: 923 [2022-11-18 20:36:08,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 193 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-18 20:36:08,975 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 1 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1104 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-18 20:36:08,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:36:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2022-11-18 20:36:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 911. [2022-11-18 20:36:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 709 states have (on average 1.2524682651622003) internal successors, (888), 717 states have internal predecessors, (888), 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-18 20:36:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1191 transitions. [2022-11-18 20:36:09,110 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1191 transitions. Word has length 164 [2022-11-18 20:36:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:09,110 INFO L495 AbstractCegarLoop]: Abstraction has 911 states and 1191 transitions. [2022-11-18 20:36:09,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 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-18 20:36:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1191 transitions. [2022-11-18 20:36:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-11-18 20:36:09,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:09,115 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] [2022-11-18 20:36:09,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:09,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:09,323 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1692113821, now seen corresponding path program 1 times [2022-11-18 20:36:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:09,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460152094] [2022-11-18 20:36:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:09,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:36:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-18 20:36:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-18 20:36:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-11-18 20:36:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 20:36:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:10,668 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-18 20:36:10,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460152094] [2022-11-18 20:36:10,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460152094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121735339] [2022-11-18 20:36:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:10,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:10,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:10,671 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:10,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:36:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:11,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-18 20:36:11,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-18 20:36:11,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:11,708 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-18 20:36:11,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121735339] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:36:11,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:36:11,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2022-11-18 20:36:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184199910] [2022-11-18 20:36:11,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:11,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:36:11,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:11,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:36:11,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:36:11,711 INFO L87 Difference]: Start difference. First operand 911 states and 1191 transitions. Second operand has 20 states, 20 states have (on average 6.5) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-18 20:36:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:13,133 INFO L93 Difference]: Finished difference Result 2037 states and 2690 transitions. [2022-11-18 20:36:13,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:36:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.5) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) Word has length 170 [2022-11-18 20:36:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:13,140 INFO L225 Difference]: With dead ends: 2037 [2022-11-18 20:36:13,140 INFO L226 Difference]: Without dead ends: 1145 [2022-11-18 20:36:13,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:36:13,143 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 201 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2994 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:13,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 2994 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:36:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-11-18 20:36:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 951. [2022-11-18 20:36:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 741 states have (on average 1.2415654520917678) internal successors, (920), 745 states have internal predecessors, (920), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-18 20:36:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1243 transitions. [2022-11-18 20:36:13,286 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1243 transitions. Word has length 170 [2022-11-18 20:36:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:13,287 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1243 transitions. [2022-11-18 20:36:13,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.5) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-18 20:36:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1243 transitions. [2022-11-18 20:36:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-18 20:36:13,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:13,291 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] [2022-11-18 20:36:13,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:13,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:13,499 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -507629633, now seen corresponding path program 2 times [2022-11-18 20:36:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868908309] [2022-11-18 20:36:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:36:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:36:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 20:36:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:36:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-18 20:36:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:36:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 20:36:14,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868908309] [2022-11-18 20:36:14,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868908309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:14,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26764131] [2022-11-18 20:36:14,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:36:14,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:14,707 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:14,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:36:15,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:36:15,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:15,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:36:15,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:15,243 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-18 20:36:15,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:15,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26764131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:15,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:36:15,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2022-11-18 20:36:15,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574610521] [2022-11-18 20:36:15,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:15,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:36:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:36:15,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:36:15,249 INFO L87 Difference]: Start difference. First operand 951 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-18 20:36:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:15,808 INFO L93 Difference]: Finished difference Result 1931 states and 2619 transitions. [2022-11-18 20:36:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:36:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 176 [2022-11-18 20:36:15,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:15,816 INFO L225 Difference]: With dead ends: 1931 [2022-11-18 20:36:15,816 INFO L226 Difference]: Without dead ends: 1461 [2022-11-18 20:36:15,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:36:15,820 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 553 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1920 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-18 20:36:15,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1920 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:36:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2022-11-18 20:36:15,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 957. [2022-11-18 20:36:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 747 states have (on average 1.2396251673360108) internal successors, (926), 751 states have internal predecessors, (926), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-18 20:36:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1249 transitions. [2022-11-18 20:36:15,999 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1249 transitions. Word has length 176 [2022-11-18 20:36:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:15,999 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1249 transitions. [2022-11-18 20:36:16,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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-18 20:36:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1249 transitions. [2022-11-18 20:36:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-18 20:36:16,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:16,005 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] [2022-11-18 20:36:16,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:16,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:36:16,214 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:16,214 INFO L85 PathProgramCache]: Analyzing trace with hash -745303818, now seen corresponding path program 1 times [2022-11-18 20:36:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:16,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186313436] [2022-11-18 20:36:16,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:16,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:16,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:36:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:36:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:36:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 20:36:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:36:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-18 20:36:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-18 20:36:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:16,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186313436] [2022-11-18 20:36:16,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186313436] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:16,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402833374] [2022-11-18 20:36:16,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:16,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:16,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:16,814 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:16,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:36:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:17,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:36:17,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-18 20:36:17,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:36:17,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402833374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:17,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:36:17,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-18 20:36:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102146244] [2022-11-18 20:36:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:36:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:36:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:36:17,742 INFO L87 Difference]: Start difference. First operand 957 states and 1249 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-18 20:36:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:18,393 INFO L93 Difference]: Finished difference Result 2835 states and 3710 transitions. [2022-11-18 20:36:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:36:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 209 [2022-11-18 20:36:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:18,407 INFO L225 Difference]: With dead ends: 2835 [2022-11-18 20:36:18,407 INFO L226 Difference]: Without dead ends: 2827 [2022-11-18 20:36:18,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 249 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-18 20:36:18,410 INFO L413 NwaCegarLoop]: 571 mSDtfsCounter, 400 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1037 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-18 20:36:18,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1037 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:36:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-11-18 20:36:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2813. [2022-11-18 20:36:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2199 states have (on average 1.2432924056389267) internal successors, (2734), 2215 states have internal predecessors, (2734), 430 states have call successors, (430), 160 states have call predecessors, (430), 183 states have return successors, (525), 461 states have call predecessors, (525), 429 states have call successors, (525) [2022-11-18 20:36:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3689 transitions. [2022-11-18 20:36:19,029 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3689 transitions. Word has length 209 [2022-11-18 20:36:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:19,029 INFO L495 AbstractCegarLoop]: Abstraction has 2813 states and 3689 transitions. [2022-11-18 20:36:19,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-18 20:36:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3689 transitions. [2022-11-18 20:36:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-18 20:36:19,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:19,037 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] [2022-11-18 20:36:19,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:36:19,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 20:36:19,247 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:19,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:19,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1756421068, now seen corresponding path program 1 times [2022-11-18 20:36:19,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:19,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387449624] [2022-11-18 20:36:19,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:36:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:36:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:36:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 20:36:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:36:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-11-18 20:36:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-18 20:36:19,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:19,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387449624] [2022-11-18 20:36:19,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387449624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:36:19,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:36:19,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:36:19,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006627275] [2022-11-18 20:36:19,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:36:19,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:36:19,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:36:19,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:36:19,676 INFO L87 Difference]: Start difference. First operand 2813 states and 3689 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 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-18 20:36:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:21,685 INFO L93 Difference]: Finished difference Result 8907 states and 11752 transitions. [2022-11-18 20:36:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:36:21,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 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 209 [2022-11-18 20:36:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:21,716 INFO L225 Difference]: With dead ends: 8907 [2022-11-18 20:36:21,716 INFO L226 Difference]: Without dead ends: 6113 [2022-11-18 20:36:21,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:36:21,726 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 565 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:21,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1255 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:36:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6113 states. [2022-11-18 20:36:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6113 to 2825. [2022-11-18 20:36:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2211 states have (on average 1.2419719583898687) internal successors, (2746), 2231 states have internal predecessors, (2746), 430 states have call successors, (430), 160 states have call predecessors, (430), 183 states have return successors, (525), 457 states have call predecessors, (525), 429 states have call successors, (525) [2022-11-18 20:36:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3701 transitions. [2022-11-18 20:36:22,311 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3701 transitions. Word has length 209 [2022-11-18 20:36:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:22,315 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 3701 transitions. [2022-11-18 20:36:22,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 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-18 20:36:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3701 transitions. [2022-11-18 20:36:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-11-18 20:36:22,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:22,323 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] [2022-11-18 20:36:22,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:36:22,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 458266976, now seen corresponding path program 1 times [2022-11-18 20:36:22,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150129272] [2022-11-18 20:36:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:36:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:36:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-18 20:36:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-18 20:36:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-18 20:36:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-18 20:36:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-18 20:36:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-18 20:36:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:36:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-11-18 20:36:23,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150129272] [2022-11-18 20:36:23,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150129272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:23,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255863996] [2022-11-18 20:36:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:23,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:23,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:23,927 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:23,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:36:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:24,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1837 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-18 20:36:24,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:24,601 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-18 20:36:24,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-11-18 20:36:25,391 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-18 20:36:25,411 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1059 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1059) |c_#memory_int|)) is different from true [2022-11-18 20:36:25,495 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-18 20:36:25,498 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-18 20:36:25,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:25,555 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-18 20:36:25,573 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:36:25,574 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-18 20:36:25,720 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-18 20:36:25,863 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-18 20:36:25,988 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:36:25,989 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-18 20:36:26,494 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-18 20:36:27,098 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:36:27,098 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-18 20:36:28,190 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-18 20:36:28,408 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-18 20:36:28,421 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-18 20:36:28,665 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-18 20:36:28,678 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-18 20:36:28,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:28,712 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-18 20:36:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 36 proven. 51 refuted. 8 times theorem prover too weak. 18 trivial. 2 not checked. [2022-11-18 20:36:28,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:30,786 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (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_1071) |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-18 20:36:30,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255863996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:30,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:30,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 39] total 50 [2022-11-18 20:36:30,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253702290] [2022-11-18 20:36:30,826 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:30,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-18 20:36:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-18 20:36:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2172, Unknown=30, NotChecked=190, Total=2550 [2022-11-18 20:36:30,829 INFO L87 Difference]: Start difference. First operand 2825 states and 3701 transitions. Second operand has 50 states, 47 states have (on average 5.382978723404255) internal successors, (253), 36 states have internal predecessors, (253), 15 states have call successors, (41), 11 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41) [2022-11-18 20:36:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:33,844 INFO L93 Difference]: Finished difference Result 8274 states and 11162 transitions. [2022-11-18 20:36:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-18 20:36:33,845 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 5.382978723404255) internal successors, (253), 36 states have internal predecessors, (253), 15 states have call successors, (41), 11 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41) Word has length 210 [2022-11-18 20:36:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:33,873 INFO L225 Difference]: With dead ends: 8274 [2022-11-18 20:36:33,873 INFO L226 Difference]: Without dead ends: 5468 [2022-11-18 20:36:33,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 261 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=300, Invalid=4494, Unknown=44, NotChecked=274, Total=5112 [2022-11-18 20:36:33,884 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 685 mSDsluCounter, 8850 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 9313 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1593 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:33,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 9313 Invalid, 2862 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [139 Valid, 1130 Invalid, 0 Unknown, 1593 Unchecked, 1.1s Time] [2022-11-18 20:36:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2022-11-18 20:36:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 3035. [2022-11-18 20:36:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 2388 states have (on average 1.246649916247906) internal successors, (2977), 2412 states have internal predecessors, (2977), 445 states have call successors, (445), 174 states have call predecessors, (445), 201 states have return successors, (548), 472 states have call predecessors, (548), 444 states have call successors, (548) [2022-11-18 20:36:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 3970 transitions. [2022-11-18 20:36:34,596 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 3970 transitions. Word has length 210 [2022-11-18 20:36:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:34,597 INFO L495 AbstractCegarLoop]: Abstraction has 3035 states and 3970 transitions. [2022-11-18 20:36:34,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 5.382978723404255) internal successors, (253), 36 states have internal predecessors, (253), 15 states have call successors, (41), 11 states have call predecessors, (41), 15 states have return successors, (41), 18 states have call predecessors, (41), 15 states have call successors, (41) [2022-11-18 20:36:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 3970 transitions. [2022-11-18 20:36:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-11-18 20:36:34,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:34,605 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] [2022-11-18 20:36:34,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-18 20:36:34,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:36:34,816 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 930140222, now seen corresponding path program 2 times [2022-11-18 20:36:34,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:34,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300319497] [2022-11-18 20:36:34,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:35,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:35,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:35,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-18 20:36:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-18 20:36:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-18 20:36:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-18 20:36:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-18 20:36:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-18 20:36:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-18 20:36:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:36:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-18 20:36:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-18 20:36:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-18 20:36:36,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:36,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300319497] [2022-11-18 20:36:36,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300319497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:36,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131542132] [2022-11-18 20:36:36,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:36:36,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:36,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:36,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:36,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:36:36,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:36:36,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:36:36,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 1863 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-18 20:36:36,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:36,870 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-18 20:36:36,902 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-18 20:36:37,300 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-18 20:36:37,307 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1356 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1356) |c_#memory_int|)) is different from true [2022-11-18 20:36:37,403 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-18 20:36:37,407 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-18 20:36:37,528 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:36:37,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 19 [2022-11-18 20:36:37,553 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:36:37,553 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-18 20:36:37,767 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-18 20:36:37,883 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-18 20:36:38,117 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:36:38,118 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-18 20:36:38,981 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-18 20:36:39,048 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-18 20:36:39,485 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 20:36:39,486 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-18 20:36:39,698 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-18 20:36:40,239 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 20:36:40,239 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-18 20:36:40,702 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-18 20:36:40,961 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-18 20:36:40,978 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-18 20:36:41,215 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-18 20:36:41,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-18 20:36:41,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:41,291 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-18 20:36:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 42 proven. 68 refuted. 0 times theorem prover too weak. 23 trivial. 2 not checked. [2022-11-18 20:36:41,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:43,443 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1367 (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_1367) |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-18 20:36:43,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131542132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:43,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:43,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 50] total 57 [2022-11-18 20:36:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490689009] [2022-11-18 20:36:43,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:43,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-18 20:36:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-18 20:36:43,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=3054, Unknown=3, NotChecked=226, Total=3540 [2022-11-18 20:36:43,469 INFO L87 Difference]: Start difference. First operand 3035 states and 3970 transitions. Second operand has 57 states, 53 states have (on average 4.69811320754717) internal successors, (249), 41 states have internal predecessors, (249), 15 states have call successors, (40), 13 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-18 20:36:48,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:48,062 INFO L93 Difference]: Finished difference Result 8673 states and 11732 transitions. [2022-11-18 20:36:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-18 20:36:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 4.69811320754717) internal successors, (249), 41 states have internal predecessors, (249), 15 states have call successors, (40), 13 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) Word has length 216 [2022-11-18 20:36:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:48,087 INFO L225 Difference]: With dead ends: 8673 [2022-11-18 20:36:48,088 INFO L226 Difference]: Without dead ends: 5843 [2022-11-18 20:36:48,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 255 SyntacticMatches, 15 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=459, Invalid=6350, Unknown=5, NotChecked=326, Total=7140 [2022-11-18 20:36:48,098 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 1146 mSDsluCounter, 10873 mSDsCounter, 0 mSdLazyCounter, 2284 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 11353 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3614 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:48,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 11353 Invalid, 6096 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [198 Valid, 2284 Invalid, 0 Unknown, 3614 Unchecked, 2.4s Time] [2022-11-18 20:36:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5843 states. [2022-11-18 20:36:48,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5843 to 3393. [2022-11-18 20:36:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3393 states, 2678 states have (on average 1.2453323375653473) internal successors, (3335), 2700 states have internal predecessors, (3335), 493 states have call successors, (493), 190 states have call predecessors, (493), 221 states have return successors, (610), 528 states have call predecessors, (610), 492 states have call successors, (610) [2022-11-18 20:36:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3393 states to 3393 states and 4438 transitions. [2022-11-18 20:36:48,885 INFO L78 Accepts]: Start accepts. Automaton has 3393 states and 4438 transitions. Word has length 216 [2022-11-18 20:36:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:36:48,886 INFO L495 AbstractCegarLoop]: Abstraction has 3393 states and 4438 transitions. [2022-11-18 20:36:48,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 4.69811320754717) internal successors, (249), 41 states have internal predecessors, (249), 15 states have call successors, (40), 13 states have call predecessors, (40), 15 states have return successors, (40), 19 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-18 20:36:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 3393 states and 4438 transitions. [2022-11-18 20:36:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-18 20:36:48,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:36:48,896 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:36:48,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-18 20:36:49,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:36:49,105 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:36:49,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:36:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1577780943, now seen corresponding path program 1 times [2022-11-18 20:36:49,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:36:49,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898402841] [2022-11-18 20:36:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:36:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:49,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:36:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:36:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:36:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:36:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:36:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:36:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:36:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:36:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:36:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:36:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:36:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:36:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-18 20:36:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-18 20:36:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-18 20:36:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-18 20:36:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-18 20:36:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-11-18 20:36:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:36:50,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898402841] [2022-11-18 20:36:50,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898402841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:50,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25570015] [2022-11-18 20:36:50,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:36:50,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:36:50,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:36:50,166 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:36:50,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:36:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:36:50,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 1917 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-18 20:36:50,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:36:50,812 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-18 20:36:50,846 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-18 20:36:51,207 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-18 20:36:51,386 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-18 20:36:51,390 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-18 20:36:51,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:51,499 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-18 20:36:51,520 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:36:51,520 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-18 20:36:51,785 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-18 20:36:51,941 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-18 20:36:52,034 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-18 20:36:52,129 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 20:36:52,129 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-18 20:36:52,783 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-18 20:36:52,902 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-18 20:36:53,446 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 20:36:53,446 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-18 20:36:53,671 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-18 20:36:54,130 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 20:36:54,131 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-18 20:36:54,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:36:54,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:36:54,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:36:54,832 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-18 20:36:54,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:36:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:36:54,864 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-18 20:36:54,906 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 47 proven. 101 refuted. 4 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-18 20:36:54,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:36:54,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1673 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1673) |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-18 20:36:54,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25570015] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:36:54,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:36:54,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 43] total 51 [2022-11-18 20:36:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79620854] [2022-11-18 20:36:54,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:36:54,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 20:36:54,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:36:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 20:36:54,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2287, Unknown=45, NotChecked=98, Total=2652 [2022-11-18 20:36:54,971 INFO L87 Difference]: Start difference. First operand 3393 states and 4438 transitions. Second operand has 51 states, 48 states have (on average 5.4375) internal successors, (261), 38 states have internal predecessors, (261), 16 states have call successors, (42), 14 states have call predecessors, (42), 18 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) [2022-11-18 20:36:59,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:36:59,567 INFO L93 Difference]: Finished difference Result 10712 states and 14558 transitions. [2022-11-18 20:36:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-18 20:36:59,572 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 5.4375) internal successors, (261), 38 states have internal predecessors, (261), 16 states have call successors, (42), 14 states have call predecessors, (42), 18 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) Word has length 229 [2022-11-18 20:36:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:36:59,601 INFO L225 Difference]: With dead ends: 10712 [2022-11-18 20:36:59,601 INFO L226 Difference]: Without dead ends: 7798 [2022-11-18 20:36:59,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 279 SyntacticMatches, 19 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=409, Invalid=4941, Unknown=56, NotChecked=144, Total=5550 [2022-11-18 20:36:59,612 INFO L413 NwaCegarLoop]: 599 mSDtfsCounter, 882 mSDsluCounter, 12538 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 13137 SdHoareTripleChecker+Invalid, 6085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3684 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:36:59,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 13137 Invalid, 6085 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [231 Valid, 2170 Invalid, 0 Unknown, 3684 Unchecked, 2.3s Time] [2022-11-18 20:36:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2022-11-18 20:37:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 3694. [2022-11-18 20:37:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 2929 states have (on average 1.2454762717651076) internal successors, (3648), 2939 states have internal predecessors, (3648), 519 states have call successors, (519), 208 states have call predecessors, (519), 245 states have return successors, (654), 572 states have call predecessors, (654), 518 states have call successors, (654) [2022-11-18 20:37:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4821 transitions. [2022-11-18 20:37:00,544 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4821 transitions. Word has length 229 [2022-11-18 20:37:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:00,545 INFO L495 AbstractCegarLoop]: Abstraction has 3694 states and 4821 transitions. [2022-11-18 20:37:00,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 5.4375) internal successors, (261), 38 states have internal predecessors, (261), 16 states have call successors, (42), 14 states have call predecessors, (42), 18 states have return successors, (43), 19 states have call predecessors, (43), 16 states have call successors, (43) [2022-11-18 20:37:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4821 transitions. [2022-11-18 20:37:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-18 20:37:00,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:00,556 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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, 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] [2022-11-18 20:37:00,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:00,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:37:00,765 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2112886957, now seen corresponding path program 1 times [2022-11-18 20:37:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:37:00,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885515033] [2022-11-18 20:37:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:37:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:37:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:37:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:37:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:37:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:37:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:37:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:37:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:37:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:37:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:37:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:37:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:37:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:37:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-18 20:37:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-18 20:37:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-18 20:37:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-11-18 20:37:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:37:01,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885515033] [2022-11-18 20:37:01,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885515033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:01,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:01,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 20:37:01,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82541697] [2022-11-18 20:37:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:01,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 20:37:01,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:37:01,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 20:37:01,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:37:01,597 INFO L87 Difference]: Start difference. First operand 3694 states and 4821 transitions. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 4 states have internal predecessors, (130), 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-18 20:37:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:02,692 INFO L93 Difference]: Finished difference Result 6620 states and 8617 transitions. [2022-11-18 20:37:02,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:37:02,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 4 states have internal predecessors, (130), 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 235 [2022-11-18 20:37:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:02,707 INFO L225 Difference]: With dead ends: 6620 [2022-11-18 20:37:02,707 INFO L226 Difference]: Without dead ends: 3694 [2022-11-18 20:37:02,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-18 20:37:02,717 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 136 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:02,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1093 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:37:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2022-11-18 20:37:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3694. [2022-11-18 20:37:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 2929 states have (on average 1.2454762717651076) internal successors, (3648), 2939 states have internal predecessors, (3648), 519 states have call successors, (519), 208 states have call predecessors, (519), 245 states have return successors, (642), 572 states have call predecessors, (642), 518 states have call successors, (642) [2022-11-18 20:37:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 4809 transitions. [2022-11-18 20:37:03,291 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 4809 transitions. Word has length 235 [2022-11-18 20:37:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:03,292 INFO L495 AbstractCegarLoop]: Abstraction has 3694 states and 4809 transitions. [2022-11-18 20:37:03,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 4 states have internal predecessors, (130), 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-18 20:37:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 4809 transitions. [2022-11-18 20:37:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-11-18 20:37:03,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:03,302 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] [2022-11-18 20:37:03,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:37:03,303 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -635051403, now seen corresponding path program 2 times [2022-11-18 20:37:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:37:03,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265736692] [2022-11-18 20:37:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:03,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:37:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:37:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:37:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:37:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-18 20:37:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:08,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-18 20:37:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-18 20:37:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-18 20:37:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 20:37:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:09,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-18 20:37:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:37:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-18 20:37:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-18 20:37:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-18 20:37:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-18 20:37:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:37:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-18 20:37:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-18 20:37:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2022-11-18 20:37:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:10,214 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-18 20:37:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:37:10,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265736692] [2022-11-18 20:37:10,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265736692] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:37:10,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804464780] [2022-11-18 20:37:10,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:37:10,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:37:10,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:37:10,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:37:10,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:37:10,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:37:10,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:37:10,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1968 conjuncts, 168 conjunts are in the unsatisfiable core [2022-11-18 20:37:10,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:10,941 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-18 20:37:11,021 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-18 20:37:11,480 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-18 20:37:11,486 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2134 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2134) |c_#memory_int|)) is different from true [2022-11-18 20:37:11,707 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-18 20:37:11,709 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-18 20:37:11,852 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-18 20:37:11,853 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-18 20:37:11,860 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-18 20:37:12,180 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-18 20:37:12,396 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-18 20:37:12,624 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-18 20:37:13,009 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:37:13,009 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-18 20:37:14,339 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-18 20:37:14,458 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-18 20:37:15,310 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 20:37:15,310 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-18 20:37:15,579 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-18 20:37:16,368 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-18 20:37:16,368 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-18 20:37:16,997 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-18 20:37:17,336 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-18 20:37:17,367 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-18 20:37:17,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:37:17,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:37:17,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:37:17,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 32 treesize of output 26 [2022-11-18 20:37:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 94 proven. 118 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-11-18 20:37:17,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:37:18,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_2147 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2147) |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-18 20:37:18,077 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2147 (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_2147) |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-18 20:37:18,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804464780] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:37:18,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:37:18,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 49] total 85 [2022-11-18 20:37:18,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654949051] [2022-11-18 20:37:18,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:37:18,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-18 20:37:18,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:37:18,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-18 20:37:18,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=6922, Unknown=5, NotChecked=510, Total=7832 [2022-11-18 20:37:18,092 INFO L87 Difference]: Start difference. First operand 3694 states and 4809 transitions. Second operand has 85 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 65 states have internal predecessors, (276), 25 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 33 states have call predecessors, (49), 25 states have call successors, (49) [2022-11-18 20:37:33,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:33,361 INFO L93 Difference]: Finished difference Result 10073 states and 13440 transitions. [2022-11-18 20:37:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-18 20:37:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 65 states have internal predecessors, (276), 25 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 33 states have call predecessors, (49), 25 states have call successors, (49) Word has length 241 [2022-11-18 20:37:33,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:33,387 INFO L225 Difference]: With dead ends: 10073 [2022-11-18 20:37:33,387 INFO L226 Difference]: Without dead ends: 7171 [2022-11-18 20:37:33,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 299 SyntacticMatches, 20 SemanticMatches, 127 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5650 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=847, Invalid=14908, Unknown=7, NotChecked=750, Total=16512 [2022-11-18 20:37:33,401 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 1989 mSDsluCounter, 15775 mSDsCounter, 0 mSdLazyCounter, 9913 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 16301 SdHoareTripleChecker+Invalid, 13957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 9913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3180 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:33,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2019 Valid, 16301 Invalid, 13957 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [864 Valid, 9913 Invalid, 0 Unknown, 3180 Unchecked, 10.7s Time] [2022-11-18 20:37:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2022-11-18 20:37:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 4274. [2022-11-18 20:37:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 3405 states have (on average 1.2552129221732746) internal successors, (4274), 3427 states have internal predecessors, (4274), 591 states have call successors, (591), 228 states have call predecessors, (591), 277 states have return successors, (736), 642 states have call predecessors, (736), 590 states have call successors, (736) [2022-11-18 20:37:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5601 transitions. [2022-11-18 20:37:34,549 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5601 transitions. Word has length 241 [2022-11-18 20:37:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:34,550 INFO L495 AbstractCegarLoop]: Abstraction has 4274 states and 5601 transitions. [2022-11-18 20:37:34,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 81 states have (on average 3.4074074074074074) internal successors, (276), 65 states have internal predecessors, (276), 25 states have call successors, (46), 13 states have call predecessors, (46), 24 states have return successors, (49), 33 states have call predecessors, (49), 25 states have call successors, (49) [2022-11-18 20:37:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5601 transitions. [2022-11-18 20:37:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-11-18 20:37:34,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:34,561 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] [2022-11-18 20:37:34,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:34,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:37:34,771 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:34,772 INFO L85 PathProgramCache]: Analyzing trace with hash -615893863, now seen corresponding path program 1 times [2022-11-18 20:37:34,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:37:34,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567896003] [2022-11-18 20:37:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:37:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:37:36,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:37:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:37:36,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:37:36,986 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:37:36,987 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:37:36,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:37:36,993 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:37:36,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:37:37,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:37:37 BoogieIcfgContainer [2022-11-18 20:37:37,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:37:37,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:37:37,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:37:37,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:37:37,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:35:56" (3/4) ... [2022-11-18 20:37:37,459 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 20:37:37,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:37:37,460 INFO L158 Benchmark]: Toolchain (without parser) took 103958.49ms. Allocated memory was 94.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 55.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. [2022-11-18 20:37:37,460 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:37:37,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1183.23ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 60.9MB in the end (delta: -5.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-18 20:37:37,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.37ms. Allocated memory is still 113.2MB. Free memory was 60.9MB in the beginning and 54.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:37:37,461 INFO L158 Benchmark]: Boogie Preprocessor took 131.46ms. Allocated memory is still 113.2MB. Free memory was 54.6MB in the beginning and 48.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-18 20:37:37,462 INFO L158 Benchmark]: RCFGBuilder took 1429.37ms. Allocated memory is still 113.2MB. Free memory was 48.8MB in the beginning and 49.0MB in the end (delta: -217.6kB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-11-18 20:37:37,462 INFO L158 Benchmark]: TraceAbstraction took 101039.77ms. Allocated memory was 113.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 867.0MB. Max. memory is 16.1GB. [2022-11-18 20:37:37,462 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:37:37,473 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.27ms. Allocated memory is still 94.4MB. Free memory was 65.2MB in the beginning and 65.2MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1183.23ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 60.9MB in the end (delta: -5.6MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.37ms. Allocated memory is still 113.2MB. Free memory was 60.9MB in the beginning and 54.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.46ms. Allocated memory is still 113.2MB. Free memory was 54.6MB in the beginning and 48.8MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1429.37ms. Allocated memory is still 113.2MB. Free memory was 48.8MB in the beginning and 49.0MB in the end (delta: -217.6kB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 101039.77ms. Allocated memory was 113.2MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 48.4MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 867.0MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. 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 3350, overapproximation of strlen at line 3778, overapproximation of bitwiseOr at line 3801, overapproximation of bitwiseAnd at line 3397. Possible FailurePath: [L4069] int SERIAL_STATE = 0; [L4071] struct urb *int_urb = (struct urb *)0; [L3543] int LDV_IN_INTERRUPT = 1; [L3837] struct usb_device_id const __mod_usb_device_table ; [L4070] void *usb_intfdata = (void *)0; [L4067] int DEV_STATE = 0; [L4073] void (*completeFnInt)(struct urb * ) ; [L4072] struct urb *bulk_urb = (struct urb *)0; [L3865] int ldv_retval_0 ; [L3866] int ldv_retval_1 ; [L4074] void (*completeFnBulk)(struct urb * ) ; [L3544] int ref_cnt ; [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}; [L4068] int INTERF_STATE = 0; [L3548] int ldv_state_variable_0 ; [L3545] int ldv_state_variable_1 ; [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}}; [L3546] int usb_counter ; [L3547] struct usb_interface *usb_acecad_driver_group1 ; [L4066] int 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, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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)={-110680464442257309695: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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)={-110680464442257309695: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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-110680464442257309695:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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)={-110680464442257309695: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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-110680464442257309695:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3503] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \result={-110680464442257309695:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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)={-110680464442257309695: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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-110680464442257309695:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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)={-110680464442257309695: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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, ldv_func_arg1={14:0}, ldv_func_arg1={14:0}, ldv_func_arg2={18446744073709551617:18446744073709551639}, ldv_func_arg2={18446744073709551617:18446744073709551639}, ldv_func_arg3={4:0}, ldv_func_arg3={4: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, driver={14:0}, driver={14: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, id={-110680464442257309695:0}, id={-110680464442257309695:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epd={-36893488147419103231:19}, epd={-36893488147419103231: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, epd={-36893488147419103231:19}, epd={-36893488147419103231: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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=0, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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)=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, __ret_warn_on=0, __this_module={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, ep={18446744073709551598:18}, 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=0, ref_cnt=0, SERIAL_STATE=0, tmp=0, udev={-36893488147419103233:0}, udev={-36893488147419103233:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-36893488147419103231:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-36893488147419103231: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-36893488147419103231:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-11}, intf={-18446744073709551617:0}, intf={-18446744073709551617:0}, kzalloc(232UL, 208U)={-36893488147419103231: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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-55340232221128654847:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-55340232221128654847:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-55340232221128654847:0}, ref_cnt=0, SERIAL_STATE=0, size=1855, tmp={-55340232221128654847:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-55340232221128654847: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-55340232221128654847:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-55340232221128654847:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-55340232221128654847: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-73786976294838206463:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206463:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-73786976294838206463:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206463:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=0, \result={-73786976294838206463:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-73786976294838206463:0}, ref_cnt=0, SERIAL_STATE=0, size=0, tmp={-73786976294838206463:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, arg0={-36893488147419103233:0}, arg0={-36893488147419103233:0}, arg1=8, arg2=208, arg3={-36893488147419103231:224}, arg3={-36893488147419103231:224}, bulk_urb={0:0}, DEV_STATE=0, int_urb={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-73786976294838206463: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, acecad->data={-73786976294838206463:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-92233720368547758079:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758079:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-92233720368547758079:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758079:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \result={-92233720368547758079:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-92233720368547758079:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={-92233720368547758079:0}, tmp___0=0, URB_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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))={-92233720368547758079: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-92233720368547758079:0}, res={-92233720368547758079:0}, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={-92233720368547758079:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={18446744073709551617:18446744073709551639}, 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={-92233720368547758079: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={-92233720368547758079:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, acecad->irq={-92233720368547758079:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->manufacturer={23:18446744073709551593}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, dev->product={27:18446744073709551589}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, actual=-1, buf={-36893488147419103231:128}, buf={-36893488147419103231: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, snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath))=-1, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, arg0={-36893488147419103231:128}, arg1={9: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=18446744073709551642, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3778] tmp___5 = strlen((char const *)(& acecad->name)) [L3779] COND TRUE tmp___5 == 0UL [L3781] dev->descriptor.idVendor [L3781] dev->descriptor.idProduct [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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] [L3474] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \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={18446744073709551617:18446744073709551639}, 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=180, tmp={-18446744073709551615:0}, tmp___0=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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))={-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=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}, value={-18446744073709551615: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}, value={-18446744073709551615: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}, value={-18446744073709551615: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, err=1, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, acecad->data={-73786976294838206463:0}, acecad->data_dma=18446744073709551645, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, err=1, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, acecad->data={-73786976294838206463:0}, acecad->data_dma=18446744073709551645, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, err=1, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, err=1, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, acecad={-36893488147419103231:0}, bulk_urb={0:0}, dev={-36893488147419103233:0}, DEV_STATE=0, endpoint={-36893488147419103231:19}, err=1, id={-110680464442257309695:0}, id={-110680464442257309695:0}, id->driver_info=0, input_dev={-55340232221128654847:0}, int_urb={0:0}, INTERF_STATE=0, interface={18446744073709551626:-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=0, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103233:0}, tmp___0=1, tmp___1=8355840, tmp___2=0, tmp___3={-36893488147419103231:0}, tmp___4={-73786976294838206463:0}, tmp___5=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=0, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, tmp___1=0, tmp___2=1, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, arg={14:0}, arg={14: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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={-110680464442257309695:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-110680464442257309695:0}, tmp___0=1, tmp___1=0, tmp___2=0, URB_STATE=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15: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={18446744073709551617:18446744073709551639}, 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={14:0}, usb_acecad_driver_group1={-18446744073709551617:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_intfdata={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 232 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 100.5s, OverallIterations: 21, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 40.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10136 SdHoareTripleChecker+Valid, 24.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9740 mSDsluCounter, 68703 SdHoareTripleChecker+Invalid, 21.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12071 IncrementalHoareTripleChecker+Unchecked, 61589 mSDsCounter, 2850 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20339 IncrementalHoareTripleChecker+Invalid, 35260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2850 mSolverCounterUnsat, 7114 mSDtfsCounter, 20339 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3124 GetRequests, 2551 SyntacticMatches, 73 SemanticMatches, 500 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 11806 ImplicationChecksByTransitivity, 26.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4274occurred in iteration=20, InterpolantAutomatonStates: 343, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 17865 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 4908 NumberOfCodeBlocks, 4783 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4802 ConstructedInterpolants, 370 QuantifiedInterpolants, 19506 SizeOfPredicates, 175 NumberOfNonLiveVariables, 14084 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 30 InterpolantComputations, 15 PerfectInterpolantSequences, 2441/2951 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-18 20:37:37,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:37:39,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:37:39,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:37:39,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:37:39,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:37:39,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:37:39,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:37:39,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:37:39,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:37:39,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:37:39,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:37:39,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:37:39,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:37:39,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:37:39,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:37:39,888 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:37:39,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:37:39,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:37:39,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:37:39,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:37:39,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:37:39,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:37:39,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:37:39,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:37:39,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:37:39,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:37:39,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:37:39,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:37:39,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:37:39,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:37:39,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:37:39,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:37:39,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:37:39,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:37:39,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:37:39,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:37:39,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:37:39,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:37:39,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:37:39,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:37:39,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:37:39,914 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 20:37:39,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:37:39,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:37:39,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:37:39,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:37:39,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:37:39,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:37:39,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:37:39,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:37:39,941 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:37:39,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:37:39,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:37:39,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:37:39,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:37:39,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:37:39,943 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:37:39,943 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 20:37:39,944 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 20:37:39,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:37:39,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:37:39,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:37:39,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:37:39,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:37:39,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:37:39,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:37:39,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:37:39,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:37:39,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:37:39,947 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 20:37:39,947 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 20:37:39,947 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:37:39,947 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:37:39,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:37:39,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 20:37:39,948 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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/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_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro 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-18 20:37:40,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:37:40,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:37:40,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:37:40,349 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:37:40,351 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:37:40,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/../../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-18 20:37:40,424 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/f2b2e0048/7552a8d720394bac8128950944c3ae2d/FLAG43c0fba5c [2022-11-18 20:37:41,306 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:37:41,307 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:37:41,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/f2b2e0048/7552a8d720394bac8128950944c3ae2d/FLAG43c0fba5c [2022-11-18 20:37:41,870 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/data/f2b2e0048/7552a8d720394bac8128950944c3ae2d [2022-11-18 20:37:41,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:37:41,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:37:41,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:37:41,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:37:41,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:37:41,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:37:41" (1/1) ... [2022-11-18 20:37:41,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f4ac78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:41, skipping insertion in model container [2022-11-18 20:37:41,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:37:41" (1/1) ... [2022-11-18 20:37:41,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:37:41,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:37:42,870 WARN L234 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_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:37:42,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:37:42,961 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 20:37:43,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:37:43,150 WARN L234 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_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:37:43,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:37:43,169 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:37:43,327 WARN L234 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_999df35d-c004-4def-9b76-7a60d27e6e48/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-18 20:37:43,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:37:43,421 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:37:43,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43 WrapperNode [2022-11-18 20:37:43,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:37:43,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:37:43,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:37:43,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:37:43,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,547 INFO L138 Inliner]: procedures = 118, calls = 318, calls flagged for inlining = 49, calls inlined = 43, statements flattened = 750 [2022-11-18 20:37:43,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:37:43,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:37:43,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:37:43,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:37:43,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,601 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,605 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:37:43,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:37:43,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:37:43,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:37:43,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (1/1) ... [2022-11-18 20:37:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:37:43,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:37:43,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:37:43,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:37:43,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-18 20:37:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-18 20:37:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 20:37:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-18 20:37:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:37:43,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:37:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:37:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:37:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:37:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:37:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-18 20:37:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-18 20:37:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-18 20:37:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-18 20:37:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:37:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:37:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-18 20:37:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-18 20:37:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-18 20:37:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-18 20:37:43,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-18 20:37:43,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-18 20:37:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:37:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:37:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:37:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:37:43,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-18 20:37:43,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-18 20:37:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:37:43,719 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-18 20:37:43,719 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-18 20:37:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-18 20:37:43,720 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-18 20:37:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:37:43,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-18 20:37:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:37:43,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-18 20:37:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-18 20:37:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:37:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 20:37:43,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:37:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-18 20:37:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-18 20:37:43,722 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-18 20:37:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 20:37:43,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 20:37:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-18 20:37:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-18 20:37:43,723 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-18 20:37:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:37:43,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:37:44,136 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:37:44,142 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:37:44,229 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:37:51,171 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:37:51,186 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:37:51,187 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 20:37:51,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:37:51 BoogieIcfgContainer [2022-11-18 20:37:51,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:37:51,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:37:51,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:37:51,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:37:51,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:37:41" (1/3) ... [2022-11-18 20:37:51,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230156a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:37:51, skipping insertion in model container [2022-11-18 20:37:51,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:37:43" (2/3) ... [2022-11-18 20:37:51,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230156a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:37:51, skipping insertion in model container [2022-11-18 20:37:51,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:37:51" (3/3) ... [2022-11-18 20:37:51,203 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-18 20:37:51,232 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:37:51,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:37:51,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:37:51,326 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;@4c3a7f70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:37:51,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:37:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 180 states have internal predecessors, (221), 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-18 20:37:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:37:51,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:51,345 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-18 20:37:51,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -709864546, now seen corresponding path program 1 times [2022-11-18 20:37:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:51,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948725902] [2022-11-18 20:37:51,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:51,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:51,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 20:37:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:51,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-18 20:37:51,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:51,816 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-18 20:37:51,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:51,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948725902] [2022-11-18 20:37:51,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948725902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:51,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:37:51,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026066031] [2022-11-18 20:37:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:51,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:37:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:51,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:37:51,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:37:51,880 INFO L87 Difference]: Start difference. First operand has 229 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 180 states have internal predecessors, (221), 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 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:37:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:51,956 INFO L93 Difference]: Finished difference Result 453 states and 612 transitions. [2022-11-18 20:37:51,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:37:51,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:37:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:51,975 INFO L225 Difference]: With dead ends: 453 [2022-11-18 20:37:51,976 INFO L226 Difference]: Without dead ends: 218 [2022-11-18 20:37:51,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:37:51,993 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:51,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:37:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-11-18 20:37:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-11-18 20:37:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.274390243902439) internal successors, (209), 169 states have internal predecessors, (209), 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-18 20:37:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2022-11-18 20:37:52,084 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 32 [2022-11-18 20:37:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:52,085 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2022-11-18 20:37:52,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:37:52,089 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2022-11-18 20:37:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:37:52,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:52,091 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-18 20:37:52,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:52,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:52,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -287162720, now seen corresponding path program 1 times [2022-11-18 20:37:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:52,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175683321] [2022-11-18 20:37:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:52,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:52,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:52,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 20:37:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:52,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:37:52,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:52,657 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-18 20:37:52,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:52,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:52,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175683321] [2022-11-18 20:37:52,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175683321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:52,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:52,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:37:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717590655] [2022-11-18 20:37:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:52,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:37:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:52,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:37:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:52,662 INFO L87 Difference]: Start difference. First operand 218 states and 283 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:37:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:52,793 INFO L93 Difference]: Finished difference Result 620 states and 808 transitions. [2022-11-18 20:37:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:37:52,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:37:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:52,798 INFO L225 Difference]: With dead ends: 620 [2022-11-18 20:37:52,799 INFO L226 Difference]: Without dead ends: 407 [2022-11-18 20:37:52,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:52,802 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 251 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:52,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 584 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:37:52,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-11-18 20:37:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-11-18 20:37:52,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 306 states have (on average 1.2679738562091503) internal successors, (388), 313 states have internal predecessors, (388), 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-18 20:37:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 528 transitions. [2022-11-18 20:37:52,877 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 528 transitions. Word has length 32 [2022-11-18 20:37:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:52,878 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 528 transitions. [2022-11-18 20:37:52,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 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-18 20:37:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 528 transitions. [2022-11-18 20:37:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:37:52,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:52,887 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-18 20:37:52,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:53,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:53,091 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:53,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:53,091 INFO L85 PathProgramCache]: Analyzing trace with hash 86368961, now seen corresponding path program 1 times [2022-11-18 20:37:53,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:53,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243502853] [2022-11-18 20:37:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:53,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:53,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:53,098 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:53,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 20:37:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:53,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:37:53,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:53,503 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-18 20:37:53,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:53,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243502853] [2022-11-18 20:37:53,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243502853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:53,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:53,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:37:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775971972] [2022-11-18 20:37:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:53,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:37:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:37:53,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:37:53,506 INFO L87 Difference]: Start difference. First operand 407 states and 528 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:37:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:53,876 INFO L93 Difference]: Finished difference Result 946 states and 1256 transitions. [2022-11-18 20:37:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:37:53,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:37:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:53,880 INFO L225 Difference]: With dead ends: 946 [2022-11-18 20:37:53,881 INFO L226 Difference]: Without dead ends: 554 [2022-11-18 20:37:53,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:37:53,883 INFO L413 NwaCegarLoop]: 445 mSDtfsCounter, 607 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:53,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1094 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:37:53,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-11-18 20:37:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 410. [2022-11-18 20:37:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 309 states have (on average 1.2621359223300972) internal successors, (390), 316 states have internal predecessors, (390), 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-18 20:37:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2022-11-18 20:37:53,933 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 55 [2022-11-18 20:37:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:53,934 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2022-11-18 20:37:53,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:37:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2022-11-18 20:37:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-18 20:37:53,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:53,936 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-18 20:37:53,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:54,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:54,164 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 766427331, now seen corresponding path program 1 times [2022-11-18 20:37:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632203217] [2022-11-18 20:37:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:54,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:54,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:54,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:54,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 20:37:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:54,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:37:54,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:54,665 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-18 20:37:54,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:54,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:54,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632203217] [2022-11-18 20:37:54,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632203217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:54,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:54,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:37:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288553886] [2022-11-18 20:37:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:54,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:37:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:37:54,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:54,668 INFO L87 Difference]: Start difference. First operand 410 states and 530 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:37:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:54,799 INFO L93 Difference]: Finished difference Result 1193 states and 1551 transitions. [2022-11-18 20:37:54,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:37:54,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:37:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:54,808 INFO L225 Difference]: With dead ends: 1193 [2022-11-18 20:37:54,808 INFO L226 Difference]: Without dead ends: 798 [2022-11-18 20:37:54,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:54,811 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 239 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:54,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 641 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:37:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-18 20:37:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2022-11-18 20:37:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 604 states have (on average 1.2566225165562914) internal successors, (759), 615 states have internal predecessors, (759), 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-18 20:37:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1029 transitions. [2022-11-18 20:37:54,921 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1029 transitions. Word has length 55 [2022-11-18 20:37:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:54,922 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1029 transitions. [2022-11-18 20:37:54,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (5), 2 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-18 20:37:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1029 transitions. [2022-11-18 20:37:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:37:54,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:54,927 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-18 20:37:54,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:55,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:55,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:55,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash -2010547391, now seen corresponding path program 1 times [2022-11-18 20:37:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:55,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116563025] [2022-11-18 20:37:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:55,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:55,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:55,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:55,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 20:37:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:55,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:37:55,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:55,674 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-18 20:37:55,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:55,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:55,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116563025] [2022-11-18 20:37:55,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116563025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:55,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:55,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:37:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466869922] [2022-11-18 20:37:55,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:55,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:37:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:55,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:37:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:55,676 INFO L87 Difference]: Start difference. First operand 796 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 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-18 20:37:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:55,755 INFO L93 Difference]: Finished difference Result 798 states and 1030 transitions. [2022-11-18 20:37:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:37:55,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 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 56 [2022-11-18 20:37:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:55,760 INFO L225 Difference]: With dead ends: 798 [2022-11-18 20:37:55,760 INFO L226 Difference]: Without dead ends: 795 [2022-11-18 20:37:55,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:55,762 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 241 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:55,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 280 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:37:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-11-18 20:37:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 795. [2022-11-18 20:37:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 604 states have (on average 1.2549668874172186) internal successors, (758), 614 states have internal predecessors, (758), 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-18 20:37:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1027 transitions. [2022-11-18 20:37:55,853 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1027 transitions. Word has length 56 [2022-11-18 20:37:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:55,853 INFO L495 AbstractCegarLoop]: Abstraction has 795 states and 1027 transitions. [2022-11-18 20:37:55,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (5), 2 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-18 20:37:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1027 transitions. [2022-11-18 20:37:55,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 20:37:55,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:55,855 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-18 20:37:55,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:56,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:56,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:56,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2097554310, now seen corresponding path program 1 times [2022-11-18 20:37:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:56,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503532481] [2022-11-18 20:37:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:56,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:56,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 20:37:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:56,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:37:56,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:56,560 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-18 20:37:56,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:56,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:56,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503532481] [2022-11-18 20:37:56,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503532481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:56,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:56,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:37:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176019831] [2022-11-18 20:37:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:56,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:37:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:37:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:56,562 INFO L87 Difference]: Start difference. First operand 795 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 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-18 20:37:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:56,672 INFO L93 Difference]: Finished difference Result 797 states and 1028 transitions. [2022-11-18 20:37:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:37:56,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 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 57 [2022-11-18 20:37:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:56,676 INFO L225 Difference]: With dead ends: 797 [2022-11-18 20:37:56,676 INFO L226 Difference]: Without dead ends: 794 [2022-11-18 20:37:56,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:56,677 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:56,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 278 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:37:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-11-18 20:37:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2022-11-18 20:37:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 604 states have (on average 1.2533112582781456) internal successors, (757), 613 states have internal predecessors, (757), 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-18 20:37:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1025 transitions. [2022-11-18 20:37:56,764 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1025 transitions. Word has length 57 [2022-11-18 20:37:56,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:56,765 INFO L495 AbstractCegarLoop]: Abstraction has 794 states and 1025 transitions. [2022-11-18 20:37:56,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 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-18 20:37:56,765 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1025 transitions. [2022-11-18 20:37:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:37:56,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:56,767 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-18 20:37:56,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:56,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:56,982 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:56,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 599693028, now seen corresponding path program 1 times [2022-11-18 20:37:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:56,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394202266] [2022-11-18 20:37:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:56,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:56,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:56,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 20:37:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:57,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:37:57,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:57,591 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-18 20:37:57,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:57,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:57,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394202266] [2022-11-18 20:37:57,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394202266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:57,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:57,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:37:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968195775] [2022-11-18 20:37:57,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:57,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:37:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:57,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:37:57,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:57,594 INFO L87 Difference]: Start difference. First operand 794 states and 1025 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 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-18 20:37:57,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:57,726 INFO L93 Difference]: Finished difference Result 796 states and 1026 transitions. [2022-11-18 20:37:57,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:37:57,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 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 58 [2022-11-18 20:37:57,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:57,732 INFO L225 Difference]: With dead ends: 796 [2022-11-18 20:37:57,732 INFO L226 Difference]: Without dead ends: 785 [2022-11-18 20:37:57,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:57,734 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 235 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:57,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:37:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-11-18 20:37:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-11-18 20:37:57,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 596 states have (on average 1.2516778523489933) internal successors, (746), 604 states have internal predecessors, (746), 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-18 20:37:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1013 transitions. [2022-11-18 20:37:57,874 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1013 transitions. Word has length 58 [2022-11-18 20:37:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:57,875 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 1013 transitions. [2022-11-18 20:37:57,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 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-18 20:37:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1013 transitions. [2022-11-18 20:37:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-18 20:37:57,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:57,886 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] [2022-11-18 20:37:57,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:58,106 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -918660879, now seen corresponding path program 1 times [2022-11-18 20:37:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:58,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899472881] [2022-11-18 20:37:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:58,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:58,110 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:58,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 20:37:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:58,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 20:37:58,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-18 20:37:58,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:58,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899472881] [2022-11-18 20:37:58,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899472881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:58,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:58,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:37:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482550784] [2022-11-18 20:37:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:58,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:37:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:58,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:37:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:58,736 INFO L87 Difference]: Start difference. First operand 785 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:37:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:37:58,938 INFO L93 Difference]: Finished difference Result 1619 states and 2097 transitions. [2022-11-18 20:37:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:37:58,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 152 [2022-11-18 20:37:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:37:58,943 INFO L225 Difference]: With dead ends: 1619 [2022-11-18 20:37:58,943 INFO L226 Difference]: Without dead ends: 849 [2022-11-18 20:37:58,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:37:58,946 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 41 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:37:58,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 535 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:37:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-11-18 20:37:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 839. [2022-11-18 20:37:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 649 states have (on average 1.263482280431433) internal successors, (820), 657 states have internal predecessors, (820), 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-18 20:37:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1087 transitions. [2022-11-18 20:37:59,064 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1087 transitions. Word has length 152 [2022-11-18 20:37:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:37:59,065 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 1087 transitions. [2022-11-18 20:37:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:37:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1087 transitions. [2022-11-18 20:37:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-18 20:37:59,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:37:59,070 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] [2022-11-18 20:37:59,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:37:59,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:59,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:37:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:37:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 738237246, now seen corresponding path program 1 times [2022-11-18 20:37:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:37:59,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428134885] [2022-11-18 20:37:59,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:37:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:37:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:37:59,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:37:59,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 20:37:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:37:59,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:37:59,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:37:59,961 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-18 20:37:59,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:37:59,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:37:59,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428134885] [2022-11-18 20:37:59,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428134885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:37:59,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:37:59,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:37:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098500553] [2022-11-18 20:37:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:37:59,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:37:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:37:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:37:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:37:59,964 INFO L87 Difference]: Start difference. First operand 839 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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-18 20:38:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:00,184 INFO L93 Difference]: Finished difference Result 1687 states and 2211 transitions. [2022-11-18 20:38:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:38:00,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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 161 [2022-11-18 20:38:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:00,190 INFO L225 Difference]: With dead ends: 1687 [2022-11-18 20:38:00,190 INFO L226 Difference]: Without dead ends: 867 [2022-11-18 20:38:00,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:38:00,196 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 1 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1088 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.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:00,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1088 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:38:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-11-18 20:38:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 855. [2022-11-18 20:38:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 661 states have (on average 1.2586989409984872) internal successors, (832), 669 states have internal predecessors, (832), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-11-18 20:38:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1119 transitions. [2022-11-18 20:38:00,333 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1119 transitions. Word has length 161 [2022-11-18 20:38:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:00,334 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1119 transitions. [2022-11-18 20:38:00,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 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-18 20:38:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1119 transitions. [2022-11-18 20:38:00,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-11-18 20:38:00,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:00,340 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] [2022-11-18 20:38:00,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:00,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:00,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:00,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1438148746, now seen corresponding path program 1 times [2022-11-18 20:38:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:00,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113867894] [2022-11-18 20:38:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:00,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:00,563 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:00,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-18 20:38:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:01,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:38:01,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-18 20:38:01,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:01,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:01,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113867894] [2022-11-18 20:38:01,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113867894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:01,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:01,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:38:01,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217735302] [2022-11-18 20:38:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:01,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:38:01,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:01,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:38:01,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:38:01,218 INFO L87 Difference]: Start difference. First operand 855 states and 1119 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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-18 20:38:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:01,471 INFO L93 Difference]: Finished difference Result 2269 states and 3048 transitions. [2022-11-18 20:38:01,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:38:01,472 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), 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 167 [2022-11-18 20:38:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:01,479 INFO L225 Difference]: With dead ends: 2269 [2022-11-18 20:38:01,479 INFO L226 Difference]: Without dead ends: 1433 [2022-11-18 20:38:01,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:38:01,482 INFO L413 NwaCegarLoop]: 343 mSDtfsCounter, 333 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:01,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1336 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:38:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-18 20:38:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 867. [2022-11-18 20:38:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 673 states have (on average 1.2540861812778603) internal successors, (844), 681 states have internal predecessors, (844), 134 states have call successors, (134), 56 states have call predecessors, (134), 59 states have return successors, (153), 137 states have call predecessors, (153), 133 states have call successors, (153) [2022-11-18 20:38:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1131 transitions. [2022-11-18 20:38:01,619 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1131 transitions. Word has length 167 [2022-11-18 20:38:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:01,620 INFO L495 AbstractCegarLoop]: Abstraction has 867 states and 1131 transitions. [2022-11-18 20:38:01,620 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), 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-18 20:38:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1131 transitions. [2022-11-18 20:38:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 20:38:01,635 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:01,635 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] [2022-11-18 20:38:01,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:01,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:01,856 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 297899197, now seen corresponding path program 1 times [2022-11-18 20:38:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:01,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462504095] [2022-11-18 20:38:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:01,858 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:01,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-18 20:38:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:02,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:38:02,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-18 20:38:02,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:02,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:02,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462504095] [2022-11-18 20:38:02,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462504095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:02,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:02,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:38:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116081968] [2022-11-18 20:38:02,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:02,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:38:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:02,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:38:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:38:02,691 INFO L87 Difference]: Start difference. First operand 867 states and 1131 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:38:05,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:06,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:06,804 INFO L93 Difference]: Finished difference Result 2263 states and 3033 transitions. [2022-11-18 20:38:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:38:06,805 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 169 [2022-11-18 20:38:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:06,813 INFO L225 Difference]: With dead ends: 2263 [2022-11-18 20:38:06,813 INFO L226 Difference]: Without dead ends: 1415 [2022-11-18 20:38:06,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:38:06,816 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 203 mSDsluCounter, 2931 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:06,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 3315 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-11-18 20:38:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2022-11-18 20:38:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 899. [2022-11-18 20:38:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 701 states have (on average 1.2439372325249642) internal successors, (872), 705 states have internal predecessors, (872), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (161), 145 states have call predecessors, (161), 133 states have call successors, (161) [2022-11-18 20:38:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1167 transitions. [2022-11-18 20:38:06,949 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1167 transitions. Word has length 169 [2022-11-18 20:38:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:06,950 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 1167 transitions. [2022-11-18 20:38:06,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 8 states have internal predecessors, (110), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 20:38:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1167 transitions. [2022-11-18 20:38:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-18 20:38:06,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:06,955 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] [2022-11-18 20:38:06,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:07,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:07,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -347768059, now seen corresponding path program 2 times [2022-11-18 20:38:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:07,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378433076] [2022-11-18 20:38:07,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:38:07,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:07,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:07,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-18 20:38:07,530 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:38:07,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:38:07,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:38:07,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:07,622 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-18 20:38:07,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:07,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:07,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378433076] [2022-11-18 20:38:07,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378433076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:07,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:07,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:38:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988873775] [2022-11-18 20:38:07,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:07,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:38:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:38:07,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:38:07,624 INFO L87 Difference]: Start difference. First operand 899 states and 1167 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 20:38:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:08,133 INFO L93 Difference]: Finished difference Result 2723 states and 3543 transitions. [2022-11-18 20:38:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:38:08,134 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 175 [2022-11-18 20:38:08,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:08,142 INFO L225 Difference]: With dead ends: 2723 [2022-11-18 20:38:08,142 INFO L226 Difference]: Without dead ends: 1843 [2022-11-18 20:38:08,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:38:08,145 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 373 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:08,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1745 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:38:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2022-11-18 20:38:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 935. [2022-11-18 20:38:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 729 states have (on average 1.2345679012345678) internal successors, (900), 733 states have internal predecessors, (900), 142 states have call successors, (142), 56 states have call predecessors, (142), 63 states have return successors, (169), 153 states have call predecessors, (169), 141 states have call successors, (169) [2022-11-18 20:38:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1211 transitions. [2022-11-18 20:38:08,329 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1211 transitions. Word has length 175 [2022-11-18 20:38:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:08,330 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1211 transitions. [2022-11-18 20:38:08,330 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 20:38:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1211 transitions. [2022-11-18 20:38:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-18 20:38:08,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:08,335 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] [2022-11-18 20:38:08,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-18 20:38:08,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:08,553 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1358885309, now seen corresponding path program 1 times [2022-11-18 20:38:08,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:08,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106575016] [2022-11-18 20:38:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:08,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:08,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:08,556 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:08,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-18 20:38:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:09,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 20:38:09,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-18 20:38:09,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:38:10,299 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-18 20:38:10,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:10,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106575016] [2022-11-18 20:38:10,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106575016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:38:10,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:38:10,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-18 20:38:10,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579137518] [2022-11-18 20:38:10,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:38:10,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:38:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:10,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:38:10,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:38:10,303 INFO L87 Difference]: Start difference. First operand 935 states and 1211 transitions. Second operand has 16 states, 16 states have (on average 7.75) internal successors, (124), 12 states have internal predecessors, (124), 4 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-18 20:38:12,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:14,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:16,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:18,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 20:38:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:18,511 INFO L93 Difference]: Finished difference Result 2077 states and 2718 transitions. [2022-11-18 20:38:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:38:18,513 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 12 states have internal predecessors, (124), 4 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) Word has length 175 [2022-11-18 20:38:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:18,521 INFO L225 Difference]: With dead ends: 2077 [2022-11-18 20:38:18,521 INFO L226 Difference]: Without dead ends: 1161 [2022-11-18 20:38:18,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:38:18,526 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 60 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:18,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 3773 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 7.8s Time] [2022-11-18 20:38:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-11-18 20:38:18,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 943. [2022-11-18 20:38:18,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 733 states have (on average 1.233287858117326) internal successors, (904), 737 states have internal predecessors, (904), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-18 20:38:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1227 transitions. [2022-11-18 20:38:18,740 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1227 transitions. Word has length 175 [2022-11-18 20:38:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:18,740 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1227 transitions. [2022-11-18 20:38:18,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.75) internal successors, (124), 12 states have internal predecessors, (124), 4 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (23), 8 states have call predecessors, (23), 4 states have call successors, (23) [2022-11-18 20:38:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1227 transitions. [2022-11-18 20:38:18,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-18 20:38:18,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:18,746 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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-18 20:38:18,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:18,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:18,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:18,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -41853573, now seen corresponding path program 2 times [2022-11-18 20:38:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:18,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284589432] [2022-11-18 20:38:18,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:38:18,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:18,976 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:18,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-18 20:38:19,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:38:19,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:38:19,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:38:19,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:19,575 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-18 20:38:19,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:19,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:19,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284589432] [2022-11-18 20:38:19,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284589432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:19,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:19,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:38:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849594593] [2022-11-18 20:38:19,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:19,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:38:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:38:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:38:19,578 INFO L87 Difference]: Start difference. First operand 943 states and 1227 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-18 20:38:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:21,138 INFO L93 Difference]: Finished difference Result 1915 states and 2585 transitions. [2022-11-18 20:38:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:38:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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 181 [2022-11-18 20:38:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:21,147 INFO L225 Difference]: With dead ends: 1915 [2022-11-18 20:38:21,148 INFO L226 Difference]: Without dead ends: 1449 [2022-11-18 20:38:21,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:38:21,150 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 569 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:21,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1779 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-18 20:38:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2022-11-18 20:38:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 949. [2022-11-18 20:38:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 739 states have (on average 1.2313937753721245) internal successors, (910), 743 states have internal predecessors, (910), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 157 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-18 20:38:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1233 transitions. [2022-11-18 20:38:21,358 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1233 transitions. Word has length 181 [2022-11-18 20:38:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:21,359 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1233 transitions. [2022-11-18 20:38:21,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-18 20:38:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1233 transitions. [2022-11-18 20:38:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-11-18 20:38:21,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:21,364 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] [2022-11-18 20:38:21,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:21,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:21,579 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1599576633, now seen corresponding path program 1 times [2022-11-18 20:38:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:21,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381472366] [2022-11-18 20:38:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:21,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:21,583 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:21,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-18 20:38:22,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:22,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-18 20:38:22,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 20:38:22,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:22,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:22,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381472366] [2022-11-18 20:38:22,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381472366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:22,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:22,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:38:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231094048] [2022-11-18 20:38:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:22,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:38:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:22,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:38:22,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:38:22,779 INFO L87 Difference]: Start difference. First operand 949 states and 1233 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:38:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:23,222 INFO L93 Difference]: Finished difference Result 2273 states and 3022 transitions. [2022-11-18 20:38:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:38:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 208 [2022-11-18 20:38:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:23,233 INFO L225 Difference]: With dead ends: 2273 [2022-11-18 20:38:23,234 INFO L226 Difference]: Without dead ends: 1343 [2022-11-18 20:38:23,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:38:23,239 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 93 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:23,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1823 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:38:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-18 20:38:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 961. [2022-11-18 20:38:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 751 states have (on average 1.2276964047936085) internal successors, (922), 751 states have internal predecessors, (922), 146 states have call successors, (146), 56 states have call predecessors, (146), 63 states have return successors, (177), 161 states have call predecessors, (177), 145 states have call successors, (177) [2022-11-18 20:38:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1245 transitions. [2022-11-18 20:38:23,522 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1245 transitions. Word has length 208 [2022-11-18 20:38:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:23,523 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1245 transitions. [2022-11-18 20:38:23,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:38:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1245 transitions. [2022-11-18 20:38:23,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-18 20:38:23,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:23,528 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] [2022-11-18 20:38:23,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:23,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:23,756 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1462329921, now seen corresponding path program 2 times [2022-11-18 20:38:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:23,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106220247] [2022-11-18 20:38:23,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:38:23,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:23,760 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:23,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-18 20:38:25,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:38:25,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:38:25,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:38:25,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-18 20:38:25,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:38:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-18 20:38:26,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106220247] [2022-11-18 20:38:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106220247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:38:26,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:38:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-18 20:38:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771636474] [2022-11-18 20:38:26,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:38:26,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:38:26,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:26,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:38:26,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:38:26,091 INFO L87 Difference]: Start difference. First operand 961 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-18 20:38:28,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:28,617 INFO L93 Difference]: Finished difference Result 5664 states and 7367 transitions. [2022-11-18 20:38:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:38:28,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 214 [2022-11-18 20:38:28,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:28,642 INFO L225 Difference]: With dead ends: 5664 [2022-11-18 20:38:28,642 INFO L226 Difference]: Without dead ends: 5656 [2022-11-18 20:38:28,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:38:28,644 INFO L413 NwaCegarLoop]: 684 mSDtfsCounter, 980 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:28,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1994 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-18 20:38:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2022-11-18 20:38:30,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5623. [2022-11-18 20:38:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5623 states, 4403 states have (on average 1.2316602316602316) internal successors, (5423), 4411 states have internal predecessors, (5423), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1047), 943 states have call predecessors, (1047), 855 states have call successors, (1047) [2022-11-18 20:38:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5623 states to 5623 states and 7326 transitions. [2022-11-18 20:38:30,062 INFO L78 Accepts]: Start accepts. Automaton has 5623 states and 7326 transitions. Word has length 214 [2022-11-18 20:38:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:30,063 INFO L495 AbstractCegarLoop]: Abstraction has 5623 states and 7326 transitions. [2022-11-18 20:38:30,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 4 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-11-18 20:38:30,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5623 states and 7326 transitions. [2022-11-18 20:38:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-18 20:38:30,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:30,076 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] [2022-11-18 20:38:30,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:30,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:30,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:30,292 INFO L85 PathProgramCache]: Analyzing trace with hash 451212671, now seen corresponding path program 1 times [2022-11-18 20:38:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:30,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411182354] [2022-11-18 20:38:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:30,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:30,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:30,294 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:30,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-18 20:38:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:31,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 1307 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 20:38:31,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-18 20:38:31,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:31,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:31,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411182354] [2022-11-18 20:38:31,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411182354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:31,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:31,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:38:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801211193] [2022-11-18 20:38:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:31,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:38:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:38:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:38:31,598 INFO L87 Difference]: Start difference. First operand 5623 states and 7326 transitions. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:38:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:34,154 INFO L93 Difference]: Finished difference Result 12429 states and 16837 transitions. [2022-11-18 20:38:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:38:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 214 [2022-11-18 20:38:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:34,214 INFO L225 Difference]: With dead ends: 12429 [2022-11-18 20:38:34,214 INFO L226 Difference]: Without dead ends: 9605 [2022-11-18 20:38:34,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:38:34,222 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 292 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:34,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1838 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:38:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2022-11-18 20:38:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 5695. [2022-11-18 20:38:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5695 states, 4475 states have (on average 1.2279329608938547) internal successors, (5495), 4459 states have internal predecessors, (5495), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1047), 967 states have call predecessors, (1047), 855 states have call successors, (1047) [2022-11-18 20:38:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5695 states to 5695 states and 7398 transitions. [2022-11-18 20:38:36,009 INFO L78 Accepts]: Start accepts. Automaton has 5695 states and 7398 transitions. Word has length 214 [2022-11-18 20:38:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:36,009 INFO L495 AbstractCegarLoop]: Abstraction has 5695 states and 7398 transitions. [2022-11-18 20:38:36,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-18 20:38:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5695 states and 7398 transitions. [2022-11-18 20:38:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-18 20:38:36,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:36,021 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] [2022-11-18 20:38:36,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:36,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:36,235 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1090884807, now seen corresponding path program 2 times [2022-11-18 20:38:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:36,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124985171] [2022-11-18 20:38:36,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:38:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:36,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:36,239 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:36,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-18 20:38:36,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 20:38:36,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:38:36,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 20:38:36,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:36,763 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-18 20:38:36,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:36,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:36,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124985171] [2022-11-18 20:38:36,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124985171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:36,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:36,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:38:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911259323] [2022-11-18 20:38:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:36,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:38:36,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:38:36,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:38:36,771 INFO L87 Difference]: Start difference. First operand 5695 states and 7398 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (18), 2 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-18 20:38:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:40,072 INFO L93 Difference]: Finished difference Result 18053 states and 23594 transitions. [2022-11-18 20:38:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:38:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (18), 2 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 220 [2022-11-18 20:38:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:40,142 INFO L225 Difference]: With dead ends: 18053 [2022-11-18 20:38:40,142 INFO L226 Difference]: Without dead ends: 12377 [2022-11-18 20:38:40,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:38:40,165 INFO L413 NwaCegarLoop]: 361 mSDtfsCounter, 331 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:40,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 939 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:38:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12377 states. [2022-11-18 20:38:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12377 to 5719. [2022-11-18 20:38:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 4499 states have (on average 1.2267170482329406) internal successors, (5519), 4491 states have internal predecessors, (5519), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1047), 959 states have call predecessors, (1047), 855 states have call successors, (1047) [2022-11-18 20:38:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7422 transitions. [2022-11-18 20:38:41,736 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7422 transitions. Word has length 220 [2022-11-18 20:38:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:41,736 INFO L495 AbstractCegarLoop]: Abstraction has 5719 states and 7422 transitions. [2022-11-18 20:38:41,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (18), 2 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-18 20:38:41,737 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7422 transitions. [2022-11-18 20:38:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-18 20:38:41,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:41,748 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] [2022-11-18 20:38:41,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:41,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:41,964 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:41,965 INFO L85 PathProgramCache]: Analyzing trace with hash -860196191, now seen corresponding path program 1 times [2022-11-18 20:38:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:41,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331943913] [2022-11-18 20:38:41,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:41,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:41,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:41,968 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:41,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-18 20:38:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:43,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 1338 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-18 20:38:43,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-11-18 20:38:43,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:38:43,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:38:43,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331943913] [2022-11-18 20:38:43,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331943913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:38:43,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:38:43,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:38:43,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555616526] [2022-11-18 20:38:43,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:38:43,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:38:43,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 20:38:43,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:38:43,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:38:43,363 INFO L87 Difference]: Start difference. First operand 5719 states and 7422 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-18 20:38:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:38:44,573 INFO L93 Difference]: Finished difference Result 11467 states and 14873 transitions. [2022-11-18 20:38:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:38:44,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 227 [2022-11-18 20:38:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:38:44,594 INFO L225 Difference]: With dead ends: 11467 [2022-11-18 20:38:44,594 INFO L226 Difference]: Without dead ends: 5719 [2022-11-18 20:38:44,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:38:44,610 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:38:44,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1081 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:38:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2022-11-18 20:38:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 5719. [2022-11-18 20:38:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5719 states, 4499 states have (on average 1.2267170482329406) internal successors, (5519), 4491 states have internal predecessors, (5519), 856 states have call successors, (856), 316 states have call predecessors, (856), 363 states have return successors, (1023), 959 states have call predecessors, (1023), 855 states have call successors, (1023) [2022-11-18 20:38:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5719 states to 5719 states and 7398 transitions. [2022-11-18 20:38:46,144 INFO L78 Accepts]: Start accepts. Automaton has 5719 states and 7398 transitions. Word has length 227 [2022-11-18 20:38:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:38:46,144 INFO L495 AbstractCegarLoop]: Abstraction has 5719 states and 7398 transitions. [2022-11-18 20:38:46,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-18 20:38:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5719 states and 7398 transitions. [2022-11-18 20:38:46,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-11-18 20:38:46,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:38:46,157 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] [2022-11-18 20:38:46,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:38:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:46,374 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:38:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:38:46,375 INFO L85 PathProgramCache]: Analyzing trace with hash -84677671, now seen corresponding path program 1 times [2022-11-18 20:38:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 20:38:46,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681876248] [2022-11-18 20:38:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:38:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 20:38:46,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 20:38:46,379 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 20:38:46,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-18 20:38:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:38:51,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-18 20:38:51,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:38:51,197 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 7 [2022-11-18 20:38:51,233 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-18 20:38:51,843 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 11 [2022-11-18 20:38:51,886 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2229 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2229))) is different from true [2022-11-18 20:38:51,913 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc64.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2229 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc64.base| v_ArrVal_2229))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc64.base|)) (exists ((v_ArrVal_2228 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc64.base| v_ArrVal_2228))))) is different from true [2022-11-18 20:38:51,947 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 11 [2022-11-18 20:38:51,951 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-18 20:38:52,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:38:52,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:38:52,051 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:38:52,052 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 27 [2022-11-18 20:38:52,231 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 7 treesize of output 5 [2022-11-18 20:38:56,336 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) (exists ((ldv_malloc_~p~0.base (_ BitVec 64))) (= (store |c_old(#valid)| ldv_malloc_~p~0.base (_ bv1 1)) |c_#valid|))) is different from true [2022-11-18 20:38:56,346 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 7 [2022-11-18 20:39:06,703 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:39:06,703 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-18 20:39:07,278 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 7 treesize of output 5 [2022-11-18 20:39:11,499 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 11 [2022-11-18 20:39:26,411 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-18 20:39:26,411 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 27 [2022-11-18 20:39:26,805 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 15 treesize of output 11 [2022-11-18 20:39:33,018 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_1|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:39:43,692 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-18 20:39:43,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:39:46,418 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_6|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:39:46,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:39:48,767 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7| (_ BitVec 64))) (= (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_7|) ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)))) is different from true [2022-11-18 20:39:49,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:39:49,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-18 20:39:51,413 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8| (_ BitVec 64))) (= ((as const (Array (_ BitVec 64) (_ BitVec 8))) (_ bv0 8)) (select |c_#memory_int| |v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_8|))) is different from true [2022-11-18 20:39:51,623 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-18 20:39:51,641 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-18 20:39:51,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:39:51,691 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 144 treesize of output 110 [2022-11-18 20:39:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 89 proven. 26 refuted. 0 times theorem prover too weak. 17 trivial. 99 not checked. [2022-11-18 20:39:51,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:39:51,882 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64)) (v_ArrVal_2240 (Array (_ BitVec 64) (_ BitVec 8)))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2240) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))))) is different from false [2022-11-18 20:39:51,950 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 (Array (_ BitVec 64) (_ BitVec 8))) (|ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ BitVec 64))) (= (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_2240) |c_ULTIMATE.start_usb_acecad_probe_~id#1.base|))) (concat (concat (concat (concat (concat (concat (concat (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv23 64))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv22 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv21 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv20 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv19 64)))) (select .cse0 (bvadd (_ bv18 64) |ULTIMATE.start_usb_acecad_probe_~id#1.offset|))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv17 64)))) (select .cse0 (bvadd |ULTIMATE.start_usb_acecad_probe_~id#1.offset| (_ bv16 64))))))) is different from false [2022-11-18 20:39:52,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 20:39:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681876248] [2022-11-18 20:39:52,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681876248] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:39:52,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1429727753] [2022-11-18 20:39:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:39:52,008 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-18 20:39:52,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/cvc4 [2022-11-18 20:39:52,010 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-18 20:39:52,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_999df35d-c004-4def-9b76-7a60d27e6e48/bin/uautomizer-TMbwUNV5ro/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process