./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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 e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:14:43,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:14:43,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:14:43,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:14:43,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:14:43,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:14:43,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:14:43,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:14:43,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:14:43,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:14:43,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:14:43,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:14:43,861 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:14:43,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:14:43,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:14:43,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:14:43,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:14:43,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:14:43,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:14:43,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:14:43,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:14:43,886 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:14:43,887 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:14:43,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:14:43,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:14:43,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:14:43,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:14:43,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:14:43,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:14:43,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:14:43,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:14:43,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:14:43,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:14:43,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:14:43,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:14:43,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:14:43,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:14:43,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:14:43,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:14:43,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:14:43,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:14:43,912 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:14:43,945 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:14:43,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:14:43,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:14:43,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:14:43,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:14:43,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:14:43,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:14:43,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:14:43,948 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:14:43,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:14:43,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:14:43,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:14:43,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:14:43,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:14:43,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:14:43,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:14:43,951 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:14:43,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:14:43,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:14:43,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:14:43,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:14:43,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:14:43,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:14:43,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:14:43,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:14:43,953 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:14:43,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:14:43,955 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:14:43,955 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:14:43,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:14:43,955 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_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-11-16 11:14:44,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:14:44,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:14:44,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:14:44,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:14:44,333 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:14:44,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 11:14:44,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/021b5c32c/4ddd142e7c5e460abaeec3607c35479b/FLAG698267e09 [2022-11-16 11:14:45,242 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:14:45,242 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 11:14:45,276 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/021b5c32c/4ddd142e7c5e460abaeec3607c35479b/FLAG698267e09 [2022-11-16 11:14:45,365 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/021b5c32c/4ddd142e7c5e460abaeec3607c35479b [2022-11-16 11:14:45,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:14:45,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:14:45,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:14:45,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:14:45,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:14:45,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:14:45" (1/1) ... [2022-11-16 11:14:45,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795e0ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:45, skipping insertion in model container [2022-11-16 11:14:45,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:14:45" (1/1) ... [2022-11-16 11:14:45,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:14:45,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:14:46,296 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-16 11:14:46,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:14:46,392 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:14:46,526 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-16 11:14:46,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:14:46,565 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:14:46,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46 WrapperNode [2022-11-16 11:14:46,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:14:46,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:14:46,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:14:46,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:14:46,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,696 INFO L138 Inliner]: procedures = 107, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 767 [2022-11-16 11:14:46,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:14:46,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:14:46,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:14:46,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:14:46,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,847 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:14:46,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:14:46,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:14:46,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:14:46,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (1/1) ... [2022-11-16 11:14:46,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:14:46,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:46,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:14:46,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:14:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 11:14:46,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 11:14:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:14:46,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 11:14:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 11:14:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 11:14:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 11:14:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 11:14:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 11:14:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-16 11:14:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-16 11:14:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:14:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-16 11:14:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-16 11:14:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 11:14:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 11:14:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-16 11:14:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-16 11:14:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-16 11:14:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-16 11:14:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:14:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:14:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:14:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:14:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-16 11:14:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-16 11:14:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:14:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-16 11:14:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-16 11:14:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-16 11:14:46,972 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-16 11:14:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-16 11:14:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-16 11:14:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:14:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:14:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:14:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-16 11:14:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-16 11:14:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-16 11:14:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-16 11:14:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:14:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:14:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:14:47,336 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:14:47,338 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:14:47,455 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 11:14:48,191 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:14:48,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:14:48,208 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:14:48,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:14:48 BoogieIcfgContainer [2022-11-16 11:14:48,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:14:48,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:14:48,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:14:48,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:14:48,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:14:45" (1/3) ... [2022-11-16 11:14:48,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32238083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:14:48, skipping insertion in model container [2022-11-16 11:14:48,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:14:46" (2/3) ... [2022-11-16 11:14:48,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32238083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:14:48, skipping insertion in model container [2022-11-16 11:14:48,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:14:48" (3/3) ... [2022-11-16 11:14:48,223 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 11:14:48,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:14:48,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:14:48,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:14:48,328 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;@7944f8d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:14:48,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:14:48,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 229 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 181 states have internal predecessors, (222), 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-16 11:14:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:14:48,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:48,343 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-16 11:14:48,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:48,349 INFO L85 PathProgramCache]: Analyzing trace with hash -60492226, now seen corresponding path program 1 times [2022-11-16 11:14:48,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:48,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264762913] [2022-11-16 11:14:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:48,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:48,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264762913] [2022-11-16 11:14:48,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264762913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:48,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:48,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:14:48,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365248942] [2022-11-16 11:14:48,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:48,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:14:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:48,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:14:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:14:48,903 INFO L87 Difference]: Start difference. First operand has 229 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 181 states have internal predecessors, (222), 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-16 11:14:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:49,494 INFO L93 Difference]: Finished difference Result 460 states and 624 transitions. [2022-11-16 11:14:49,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:14:49,497 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-16 11:14:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:49,515 INFO L225 Difference]: With dead ends: 460 [2022-11-16 11:14:49,516 INFO L226 Difference]: Without dead ends: 225 [2022-11-16 11:14:49,524 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-16 11:14:49,531 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 49 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:49,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 563 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:14:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-16 11:14:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2022-11-16 11:14:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 170 states have internal predecessors, (210), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-16 11:14:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 283 transitions. [2022-11-16 11:14:49,608 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 283 transitions. Word has length 32 [2022-11-16 11:14:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:49,609 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 283 transitions. [2022-11-16 11:14:49,610 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-16 11:14:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 283 transitions. [2022-11-16 11:14:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:14:49,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:49,615 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-16 11:14:49,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:14:49,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 362209600, now seen corresponding path program 1 times [2022-11-16 11:14:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:49,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507505044] [2022-11-16 11:14:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:49,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:49,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:49,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:14:49,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:49,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507505044] [2022-11-16 11:14:49,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507505044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:49,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:49,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135142405] [2022-11-16 11:14:49,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:49,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:49,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:49,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:49,886 INFO L87 Difference]: Start difference. First operand 218 states and 283 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-16 11:14:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:50,728 INFO L93 Difference]: Finished difference Result 632 states and 827 transitions. [2022-11-16 11:14:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:14:50,728 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-16 11:14:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:50,732 INFO L225 Difference]: With dead ends: 632 [2022-11-16 11:14:50,732 INFO L226 Difference]: Without dead ends: 419 [2022-11-16 11:14:50,733 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-16 11:14:50,734 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 307 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:50,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 752 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-16 11:14:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-11-16 11:14:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 405. [2022-11-16 11:14:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 305 states have (on average 1.2721311475409836) internal successors, (388), 313 states have internal predecessors, (388), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-16 11:14:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 525 transitions. [2022-11-16 11:14:50,773 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 525 transitions. Word has length 32 [2022-11-16 11:14:50,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:50,773 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 525 transitions. [2022-11-16 11:14:50,773 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-16 11:14:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 525 transitions. [2022-11-16 11:14:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:14:50,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:50,776 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-16 11:14:50,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:14:50,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash 409172293, now seen corresponding path program 1 times [2022-11-16 11:14:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:50,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726925121] [2022-11-16 11:14:50,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:50,984 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-16 11:14:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:50,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726925121] [2022-11-16 11:14:50,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726925121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:50,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:50,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:14:50,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28694242] [2022-11-16 11:14:50,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:50,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:14:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:14:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:14:50,987 INFO L87 Difference]: Start difference. First operand 405 states and 525 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-16 11:14:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:51,924 INFO L93 Difference]: Finished difference Result 960 states and 1283 transitions. [2022-11-16 11:14:51,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:14:51,925 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-16 11:14:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:51,929 INFO L225 Difference]: With dead ends: 960 [2022-11-16 11:14:51,929 INFO L226 Difference]: Without dead ends: 570 [2022-11-16 11:14:51,930 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-16 11:14:51,938 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 607 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:51,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1430 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 11:14:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-11-16 11:14:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 408. [2022-11-16 11:14:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 308 states have (on average 1.2662337662337662) internal successors, (390), 316 states have internal predecessors, (390), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-16 11:14:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 527 transitions. [2022-11-16 11:14:52,008 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 527 transitions. Word has length 55 [2022-11-16 11:14:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:52,012 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 527 transitions. [2022-11-16 11:14:52,012 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-16 11:14:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 527 transitions. [2022-11-16 11:14:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:14:52,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:52,023 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-16 11:14:52,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:14:52,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1146488965, now seen corresponding path program 1 times [2022-11-16 11:14:52,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:52,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605095107] [2022-11-16 11:14:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:52,359 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-16 11:14:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605095107] [2022-11-16 11:14:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605095107] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:52,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:52,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143052234] [2022-11-16 11:14:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:52,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:52,361 INFO L87 Difference]: Start difference. First operand 408 states and 527 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-16 11:14:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:53,110 INFO L93 Difference]: Finished difference Result 1221 states and 1596 transitions. [2022-11-16 11:14:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:14:53,111 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-16 11:14:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:53,121 INFO L225 Difference]: With dead ends: 1221 [2022-11-16 11:14:53,121 INFO L226 Difference]: Without dead ends: 828 [2022-11-16 11:14:53,123 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-16 11:14:53,126 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 318 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:53,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 751 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:14:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-16 11:14:53,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 790. [2022-11-16 11:14:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 601 states have (on average 1.2628951747088186) internal successors, (759), 613 states have internal predecessors, (759), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1024 transitions. [2022-11-16 11:14:53,212 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1024 transitions. Word has length 55 [2022-11-16 11:14:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:53,212 INFO L495 AbstractCegarLoop]: Abstraction has 790 states and 1024 transitions. [2022-11-16 11:14:53,213 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-16 11:14:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1024 transitions. [2022-11-16 11:14:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 11:14:53,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:53,214 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-16 11:14:53,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:14:53,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1181423866, now seen corresponding path program 1 times [2022-11-16 11:14:53,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:53,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986789683] [2022-11-16 11:14:53,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:53,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:53,544 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-16 11:14:53,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:53,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986789683] [2022-11-16 11:14:53,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986789683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:53,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:53,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:53,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809067590] [2022-11-16 11:14:53,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:53,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:53,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:53,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:53,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:53,547 INFO L87 Difference]: Start difference. First operand 790 states and 1024 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-16 11:14:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:53,980 INFO L93 Difference]: Finished difference Result 820 states and 1069 transitions. [2022-11-16 11:14:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:14:53,981 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-16 11:14:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:53,985 INFO L225 Difference]: With dead ends: 820 [2022-11-16 11:14:53,985 INFO L226 Difference]: Without dead ends: 817 [2022-11-16 11:14:53,986 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-16 11:14:53,987 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 309 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:53,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 377 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:14:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-11-16 11:14:54,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 789. [2022-11-16 11:14:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 601 states have (on average 1.2612312811980033) internal successors, (758), 612 states have internal predecessors, (758), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1022 transitions. [2022-11-16 11:14:54,076 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1022 transitions. Word has length 56 [2022-11-16 11:14:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:54,079 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1022 transitions. [2022-11-16 11:14:54,079 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-16 11:14:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1022 transitions. [2022-11-16 11:14:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:14:54,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:54,082 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-16 11:14:54,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:14:54,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:54,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:54,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2030556632, now seen corresponding path program 1 times [2022-11-16 11:14:54,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:54,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203290257] [2022-11-16 11:14:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:54,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,353 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-16 11:14:54,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:54,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203290257] [2022-11-16 11:14:54,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203290257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:54,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:54,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342342493] [2022-11-16 11:14:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:54,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:54,360 INFO L87 Difference]: Start difference. First operand 789 states and 1022 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-16 11:14:54,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:54,753 INFO L93 Difference]: Finished difference Result 819 states and 1067 transitions. [2022-11-16 11:14:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:14:54,755 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-16 11:14:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:54,763 INFO L225 Difference]: With dead ends: 819 [2022-11-16 11:14:54,763 INFO L226 Difference]: Without dead ends: 816 [2022-11-16 11:14:54,765 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-16 11:14:54,766 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 306 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:54,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 374 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:14:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-11-16 11:14:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 788. [2022-11-16 11:14:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 601 states have (on average 1.259567387687188) internal successors, (757), 611 states have internal predecessors, (757), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1020 transitions. [2022-11-16 11:14:54,832 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1020 transitions. Word has length 57 [2022-11-16 11:14:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:54,833 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 1020 transitions. [2022-11-16 11:14:54,833 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-16 11:14:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1020 transitions. [2022-11-16 11:14:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:14:54,834 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:54,835 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-16 11:14:54,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:14:54,835 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1477267901, now seen corresponding path program 1 times [2022-11-16 11:14:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:54,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486086745] [2022-11-16 11:14:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,017 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-16 11:14:55,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:55,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486086745] [2022-11-16 11:14:55,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486086745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:55,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:55,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726436200] [2022-11-16 11:14:55,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:55,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:55,020 INFO L87 Difference]: Start difference. First operand 788 states and 1020 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-16 11:14:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:55,414 INFO L93 Difference]: Finished difference Result 818 states and 1065 transitions. [2022-11-16 11:14:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:14:55,415 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-16 11:14:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:55,419 INFO L225 Difference]: With dead ends: 818 [2022-11-16 11:14:55,419 INFO L226 Difference]: Without dead ends: 815 [2022-11-16 11:14:55,420 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-16 11:14:55,421 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 266 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:55,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 519 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:14:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-11-16 11:14:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 787. [2022-11-16 11:14:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 601 states have (on average 1.2579034941763727) internal successors, (756), 610 states have internal predecessors, (756), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1018 transitions. [2022-11-16 11:14:55,483 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1018 transitions. Word has length 58 [2022-11-16 11:14:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:55,483 INFO L495 AbstractCegarLoop]: Abstraction has 787 states and 1018 transitions. [2022-11-16 11:14:55,484 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-16 11:14:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1018 transitions. [2022-11-16 11:14:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:14:55,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:55,485 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, 1] [2022-11-16 11:14:55,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:14:55,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:55,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1449316405, now seen corresponding path program 1 times [2022-11-16 11:14:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:55,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108927030] [2022-11-16 11:14:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:55,637 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-16 11:14:55,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:55,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108927030] [2022-11-16 11:14:55,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108927030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:55,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:55,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:14:55,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594923053] [2022-11-16 11:14:55,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:55,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:55,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:55,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:55,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:14:55,640 INFO L87 Difference]: Start difference. First operand 787 states and 1018 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 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-16 11:14:56,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:56,059 INFO L93 Difference]: Finished difference Result 817 states and 1063 transitions. [2022-11-16 11:14:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:14:56,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 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 59 [2022-11-16 11:14:56,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:56,064 INFO L225 Difference]: With dead ends: 817 [2022-11-16 11:14:56,064 INFO L226 Difference]: Without dead ends: 805 [2022-11-16 11:14:56,065 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-16 11:14:56,066 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 300 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:56,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 370 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:14:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-11-16 11:14:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 777. [2022-11-16 11:14:56,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 592 states have (on average 1.2567567567567568) internal successors, (744), 600 states have internal predecessors, (744), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1005 transitions. [2022-11-16 11:14:56,130 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1005 transitions. Word has length 59 [2022-11-16 11:14:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:56,131 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1005 transitions. [2022-11-16 11:14:56,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 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-16 11:14:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1005 transitions. [2022-11-16 11:14:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-16 11:14:56,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:56,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:14:56,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:56,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1923515038, now seen corresponding path program 1 times [2022-11-16 11:14:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:56,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783565256] [2022-11-16 11:14:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:56,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 11:14:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:14:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 11:14:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:14:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-16 11:14:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-16 11:14:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-16 11:14:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-16 11:14:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-16 11:14:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-16 11:14:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:14:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:56,396 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-16 11:14:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:56,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783565256] [2022-11-16 11:14:56,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783565256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:56,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:56,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:14:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47057661] [2022-11-16 11:14:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:14:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:14:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:14:56,399 INFO L87 Difference]: Start difference. First operand 777 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 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-16 11:14:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:56,878 INFO L93 Difference]: Finished difference Result 1631 states and 2125 transitions. [2022-11-16 11:14:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:14:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 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 160 [2022-11-16 11:14:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:56,884 INFO L225 Difference]: With dead ends: 1631 [2022-11-16 11:14:56,884 INFO L226 Difference]: Without dead ends: 869 [2022-11-16 11:14:56,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 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-16 11:14:56,887 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 140 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:56,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 700 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:14:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-11-16 11:14:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 831. [2022-11-16 11:14:56,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 645 states have (on average 1.2682170542635658) internal successors, (818), 653 states have internal predecessors, (818), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1079 transitions. [2022-11-16 11:14:56,971 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1079 transitions. Word has length 160 [2022-11-16 11:14:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:56,972 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1079 transitions. [2022-11-16 11:14:56,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 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-16 11:14:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1079 transitions. [2022-11-16 11:14:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-16 11:14:56,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:56,976 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:56,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:14:56,976 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1579044611, now seen corresponding path program 1 times [2022-11-16 11:14:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575080141] [2022-11-16 11:14:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:14:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-11-16 11:14:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-16 11:14:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-16 11:14:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-16 11:14:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-16 11:14:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:14:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:14:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-16 11:14:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-16 11:14:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:57,318 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-16 11:14:57,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:57,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575080141] [2022-11-16 11:14:57,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575080141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:57,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:14:57,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:14:57,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323230427] [2022-11-16 11:14:57,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:57,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:14:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:57,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:14:57,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:14:57,321 INFO L87 Difference]: Start difference. First operand 831 states and 1079 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 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-16 11:14:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:57,989 INFO L93 Difference]: Finished difference Result 2245 states and 3010 transitions. [2022-11-16 11:14:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:14:57,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 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 169 [2022-11-16 11:14:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:57,997 INFO L225 Difference]: With dead ends: 2245 [2022-11-16 11:14:57,997 INFO L226 Difference]: Without dead ends: 1433 [2022-11-16 11:14:58,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 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-16 11:14:58,000 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 460 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:14:58,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1443 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:14:58,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2022-11-16 11:14:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 843. [2022-11-16 11:14:58,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 657 states have (on average 1.2633181126331812) internal successors, (830), 665 states have internal predecessors, (830), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:14:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1091 transitions. [2022-11-16 11:14:58,081 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1091 transitions. Word has length 169 [2022-11-16 11:14:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:58,081 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1091 transitions. [2022-11-16 11:14:58,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (16), 6 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-16 11:14:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1091 transitions. [2022-11-16 11:14:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-16 11:14:58,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:58,086 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:58,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:14:58,086 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash 376998294, now seen corresponding path program 1 times [2022-11-16 11:14:58,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628232844] [2022-11-16 11:14:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:58,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:14:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:14:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:14:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:14:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:14:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:14:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:14:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 11:14:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:14:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:14:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:14:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:14:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:14:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-16 11:14:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,538 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-16 11:14:58,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:14:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628232844] [2022-11-16 11:14:58,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628232844] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:14:58,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697428928] [2022-11-16 11:14:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:58,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:14:58,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:14:58,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:14:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:14:58,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 1352 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:14:59,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:14:59,112 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-16 11:14:59,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:14:59,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697428928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:14:59,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:14:59,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-16 11:14:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600372344] [2022-11-16 11:14:59,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:14:59,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:14:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:14:59,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:14:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:14:59,122 INFO L87 Difference]: Start difference. First operand 843 states and 1091 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-16 11:14:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:14:59,512 INFO L93 Difference]: Finished difference Result 2737 states and 3576 transitions. [2022-11-16 11:14:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:14:59,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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 171 [2022-11-16 11:14:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:14:59,522 INFO L225 Difference]: With dead ends: 2737 [2022-11-16 11:14:59,522 INFO L226 Difference]: Without dead ends: 1913 [2022-11-16 11:14:59,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 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-16 11:14:59,526 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 386 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1816 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-16 11:14:59,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1816 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:14:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2022-11-16 11:14:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 879. [2022-11-16 11:14:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 685 states have (on average 1.2525547445255474) internal successors, (858), 693 states have internal predecessors, (858), 138 states have call successors, (138), 56 states have call predecessors, (138), 55 states have return successors, (139), 137 states have call predecessors, (139), 137 states have call successors, (139) [2022-11-16 11:14:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1135 transitions. [2022-11-16 11:14:59,644 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1135 transitions. Word has length 171 [2022-11-16 11:14:59,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:14:59,644 INFO L495 AbstractCegarLoop]: Abstraction has 879 states and 1135 transitions. [2022-11-16 11:14:59,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 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-16 11:14:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1135 transitions. [2022-11-16 11:14:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-16 11:14:59,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:14:59,648 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:14:59,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:14:59,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:14:59,855 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:14:59,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:14:59,856 INFO L85 PathProgramCache]: Analyzing trace with hash -634118956, now seen corresponding path program 1 times [2022-11-16 11:14:59,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:14:59,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295028488] [2022-11-16 11:14:59,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:14:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:14:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 11:15:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:15:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 11:15:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-16 11:15:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-16 11:15:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:15:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:15:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-16 11:15:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:00,566 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-16 11:15:00,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:00,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295028488] [2022-11-16 11:15:00,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295028488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:00,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330041500] [2022-11-16 11:15:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:00,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:00,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:00,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:15:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:01,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-16 11:15:01,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:01,141 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-16 11:15:01,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:15:01,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330041500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:15:01,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:15:01,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 9 [2022-11-16 11:15:01,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472252442] [2022-11-16 11:15:01,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:15:01,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:15:01,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:01,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:15:01,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:15:01,146 INFO L87 Difference]: Start difference. First operand 879 states and 1135 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:15:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:01,314 INFO L93 Difference]: Finished difference Result 1755 states and 2279 transitions. [2022-11-16 11:15:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:15:01,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 171 [2022-11-16 11:15:01,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:01,319 INFO L225 Difference]: With dead ends: 1755 [2022-11-16 11:15:01,319 INFO L226 Difference]: Without dead ends: 887 [2022-11-16 11:15:01,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:15:01,322 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:01,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1070 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:15:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-11-16 11:15:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 887. [2022-11-16 11:15:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 689 states have (on average 1.251088534107402) internal successors, (862), 701 states have internal predecessors, (862), 138 states have call successors, (138), 56 states have call predecessors, (138), 59 states have return successors, (151), 137 states have call predecessors, (151), 137 states have call successors, (151) [2022-11-16 11:15:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1151 transitions. [2022-11-16 11:15:01,445 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1151 transitions. Word has length 171 [2022-11-16 11:15:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:01,445 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1151 transitions. [2022-11-16 11:15:01,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:15:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1151 transitions. [2022-11-16 11:15:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-16 11:15:01,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:01,450 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:15:01,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 11:15:01,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:15:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:01,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1776590456, now seen corresponding path program 1 times [2022-11-16 11:15:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:01,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499807263] [2022-11-16 11:15:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:15:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:15:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:15:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:15:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:15:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-16 11:15:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-16 11:15:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-16 11:15:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:02,876 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-16 11:15:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499807263] [2022-11-16 11:15:02,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499807263] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:02,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893564667] [2022-11-16 11:15:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:02,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:02,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:02,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:15:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:03,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 11:15:03,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 11:15:03,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:15:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893564667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:15:03,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:15:03,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 16 [2022-11-16 11:15:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141674248] [2022-11-16 11:15:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:15:03,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:15:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:15:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:15:03,821 INFO L87 Difference]: Start difference. First operand 887 states and 1151 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 11:15:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:04,409 INFO L93 Difference]: Finished difference Result 2365 states and 3172 transitions. [2022-11-16 11:15:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:15:04,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 177 [2022-11-16 11:15:04,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:04,416 INFO L225 Difference]: With dead ends: 2365 [2022-11-16 11:15:04,416 INFO L226 Difference]: Without dead ends: 1497 [2022-11-16 11:15:04,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:15:04,421 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 588 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:04,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 2087 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:15:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-11-16 11:15:04,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 907. [2022-11-16 11:15:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 705 states have (on average 1.251063829787234) internal successors, (882), 713 states have internal predecessors, (882), 142 states have call successors, (142), 56 states have call predecessors, (142), 59 states have return successors, (155), 145 states have call predecessors, (155), 141 states have call successors, (155) [2022-11-16 11:15:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1179 transitions. [2022-11-16 11:15:04,575 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1179 transitions. Word has length 177 [2022-11-16 11:15:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:04,576 INFO L495 AbstractCegarLoop]: Abstraction has 907 states and 1179 transitions. [2022-11-16 11:15:04,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 5 states have internal predecessors, (109), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 11:15:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1179 transitions. [2022-11-16 11:15:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-11-16 11:15:04,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:04,580 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:15:04,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 11:15:04,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:15:04,788 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:15:04,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 903647900, now seen corresponding path program 2 times [2022-11-16 11:15:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:04,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977432026] [2022-11-16 11:15:04,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:15:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:15:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:15:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:15:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:15:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:15:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 11:15:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-11-16 11:15:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:05,922 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-16 11:15:05,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:05,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977432026] [2022-11-16 11:15:05,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977432026] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:05,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935400811] [2022-11-16 11:15:05,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:15:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:05,924 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:05,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:15:06,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:15:06,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:15:06,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:15:06,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:06,409 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-16 11:15:06,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:15:06,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935400811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:15:06,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:15:06,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2022-11-16 11:15:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896143036] [2022-11-16 11:15:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:15:06,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:15:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:15:06,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:15:06,412 INFO L87 Difference]: Start difference. First operand 907 states and 1179 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-16 11:15:06,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:06,984 INFO L93 Difference]: Finished difference Result 1973 states and 2598 transitions. [2022-11-16 11:15:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:15:06,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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 183 [2022-11-16 11:15:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:06,991 INFO L225 Difference]: With dead ends: 1973 [2022-11-16 11:15:06,991 INFO L226 Difference]: Without dead ends: 1085 [2022-11-16 11:15:06,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:15:06,994 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 700 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:06,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 2087 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:15:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2022-11-16 11:15:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 901. [2022-11-16 11:15:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 701 states have (on average 1.2496433666191156) internal successors, (876), 709 states have internal predecessors, (876), 140 states have call successors, (140), 56 states have call predecessors, (140), 59 states have return successors, (153), 143 states have call predecessors, (153), 139 states have call successors, (153) [2022-11-16 11:15:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1169 transitions. [2022-11-16 11:15:07,186 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1169 transitions. Word has length 183 [2022-11-16 11:15:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:07,187 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1169 transitions. [2022-11-16 11:15:07,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 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-16 11:15:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1169 transitions. [2022-11-16 11:15:07,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-16 11:15:07,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:07,191 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:15:07,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:07,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 11:15:07,398 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:15:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1158343589, now seen corresponding path program 1 times [2022-11-16 11:15:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:07,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120394427] [2022-11-16 11:15:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:15:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:15:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:15:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:15:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:15:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:15:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-16 11:15:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 11:15:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-16 11:15:07,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:07,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120394427] [2022-11-16 11:15:07,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120394427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:07,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990744320] [2022-11-16 11:15:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:07,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:07,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:07,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:07,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:15:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:08,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 1807 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:15:08,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-16 11:15:08,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:15:08,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990744320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:15:08,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:15:08,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-16 11:15:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949707145] [2022-11-16 11:15:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:15:08,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:15:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:15:08,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:15:08,668 INFO L87 Difference]: Start difference. First operand 901 states and 1169 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, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 11:15:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:09,352 INFO L93 Difference]: Finished difference Result 2667 states and 3470 transitions. [2022-11-16 11:15:09,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:15:09,353 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, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 198 [2022-11-16 11:15:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:09,365 INFO L225 Difference]: With dead ends: 2667 [2022-11-16 11:15:09,365 INFO L226 Difference]: Without dead ends: 2659 [2022-11-16 11:15:09,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 234 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-16 11:15:09,369 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 386 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:09,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1043 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:15:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2022-11-16 11:15:09,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2645. [2022-11-16 11:15:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2061 states have (on average 1.2537603105288695) internal successors, (2584), 2089 states have internal predecessors, (2584), 412 states have call successors, (412), 160 states have call predecessors, (412), 171 states have return successors, (453), 419 states have call predecessors, (453), 411 states have call successors, (453) [2022-11-16 11:15:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3449 transitions. [2022-11-16 11:15:09,926 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3449 transitions. Word has length 198 [2022-11-16 11:15:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:09,927 INFO L495 AbstractCegarLoop]: Abstraction has 2645 states and 3449 transitions. [2022-11-16 11:15:09,927 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, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-16 11:15:09,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3449 transitions. [2022-11-16 11:15:09,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-11-16 11:15:09,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:09,932 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:15:09,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:10,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-16 11:15:10,141 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:15:10,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:10,141 INFO L85 PathProgramCache]: Analyzing trace with hash 147226339, now seen corresponding path program 1 times [2022-11-16 11:15:10,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:10,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491550624] [2022-11-16 11:15:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:15:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:15:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:15:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:15:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:15:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:15:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-16 11:15:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-16 11:15:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:10,537 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-16 11:15:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:10,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491550624] [2022-11-16 11:15:10,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491550624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:15:10,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:15:10,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:15:10,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110858091] [2022-11-16 11:15:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:15:10,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:15:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:10,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:15:10,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:15:10,540 INFO L87 Difference]: Start difference. First operand 2645 states and 3449 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-16 11:15:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:12,528 INFO L93 Difference]: Finished difference Result 8523 states and 11182 transitions. [2022-11-16 11:15:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:15:12,529 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 198 [2022-11-16 11:15:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:12,553 INFO L225 Difference]: With dead ends: 8523 [2022-11-16 11:15:12,553 INFO L226 Difference]: Without dead ends: 5897 [2022-11-16 11:15:12,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:15:12,561 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 547 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:12,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1237 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-16 11:15:12,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5897 states. [2022-11-16 11:15:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5897 to 2657. [2022-11-16 11:15:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2073 states have (on average 1.2522913651712495) internal successors, (2596), 2105 states have internal predecessors, (2596), 412 states have call successors, (412), 160 states have call predecessors, (412), 171 states have return successors, (453), 415 states have call predecessors, (453), 411 states have call successors, (453) [2022-11-16 11:15:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3461 transitions. [2022-11-16 11:15:13,278 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3461 transitions. Word has length 198 [2022-11-16 11:15:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:13,282 INFO L495 AbstractCegarLoop]: Abstraction has 2657 states and 3461 transitions. [2022-11-16 11:15:13,282 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, (17), 6 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-16 11:15:13,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3461 transitions. [2022-11-16 11:15:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-16 11:15:13,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:13,289 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:15:13,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:15:13,289 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:15:13,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash 713168927, now seen corresponding path program 1 times [2022-11-16 11:15:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:13,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194684067] [2022-11-16 11:15:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:15:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:15:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-16 11:15:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-16 11:15:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-16 11:15:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:15:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-16 11:15:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 11:15:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-16 11:15:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:14,689 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-16 11:15:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:14,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194684067] [2022-11-16 11:15:14,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194684067] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:14,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227977668] [2022-11-16 11:15:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:14,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:14,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:14,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:15:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:15,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 1821 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-16 11:15:15,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:15:15,364 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-16 11:15:15,437 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-16 11:15:15,943 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1046 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1046) |c_#memory_int|)) is different from true [2022-11-16 11:15:16,013 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-16 11:15:16,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:15:16,046 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-16 11:15:16,054 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:15:16,054 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-16 11:15:17,612 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-16 11:15:17,987 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-16 11:15:18,003 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-16 11:15:18,229 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-16 11:15:18,242 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-16 11:15:18,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:15:18,274 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-16 11:15:18,319 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 44 trivial. 2 not checked. [2022-11-16 11:15:18,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:15:18,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1056 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1056) |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-16 11:15:18,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227977668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:18,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:15:18,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 31] total 41 [2022-11-16 11:15:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364888319] [2022-11-16 11:15:18,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:15:18,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 11:15:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:15:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 11:15:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1422, Unknown=13, NotChecked=154, Total=1722 [2022-11-16 11:15:18,421 INFO L87 Difference]: Start difference. First operand 2657 states and 3461 transitions. Second operand has 41 states, 38 states have (on average 6.394736842105263) internal successors, (243), 28 states have internal predecessors, (243), 13 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (37), 17 states have call predecessors, (37), 13 states have call successors, (37) [2022-11-16 11:15:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:15:22,279 INFO L93 Difference]: Finished difference Result 7425 states and 9890 transitions. [2022-11-16 11:15:22,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-16 11:15:22,280 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 6.394736842105263) internal successors, (243), 28 states have internal predecessors, (243), 13 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (37), 17 states have call predecessors, (37), 13 states have call successors, (37) Word has length 205 [2022-11-16 11:15:22,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:15:22,301 INFO L225 Difference]: With dead ends: 7425 [2022-11-16 11:15:22,301 INFO L226 Difference]: Without dead ends: 4787 [2022-11-16 11:15:22,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 247 SyntacticMatches, 16 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=282, Invalid=3734, Unknown=24, NotChecked=250, Total=4290 [2022-11-16 11:15:22,310 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 566 mSDsluCounter, 9162 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 9591 SdHoareTripleChecker+Invalid, 3959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1749 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-16 11:15:22,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 9591 Invalid, 3959 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [155 Valid, 2055 Invalid, 0 Unknown, 1749 Unchecked, 1.9s Time] [2022-11-16 11:15:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4787 states. [2022-11-16 11:15:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4787 to 3323. [2022-11-16 11:15:23,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3323 states, 2644 states have (on average 1.2605900151285931) internal successors, (3333), 2676 states have internal predecessors, (3333), 469 states have call successors, (469), 182 states have call predecessors, (469), 209 states have return successors, (558), 488 states have call predecessors, (558), 468 states have call successors, (558) [2022-11-16 11:15:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4360 transitions. [2022-11-16 11:15:23,047 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4360 transitions. Word has length 205 [2022-11-16 11:15:23,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:15:23,047 INFO L495 AbstractCegarLoop]: Abstraction has 3323 states and 4360 transitions. [2022-11-16 11:15:23,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 6.394736842105263) internal successors, (243), 28 states have internal predecessors, (243), 13 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (37), 17 states have call predecessors, (37), 13 states have call successors, (37) [2022-11-16 11:15:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4360 transitions. [2022-11-16 11:15:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-11-16 11:15:23,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:15:23,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:15:23,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:15:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:23,267 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:15:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:15:23,268 INFO L85 PathProgramCache]: Analyzing trace with hash 172593027, now seen corresponding path program 2 times [2022-11-16 11:15:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:15:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102704257] [2022-11-16 11:15:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:15:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:15:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:15:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:15:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:15:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:15:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:15:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:15:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:15:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:15:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-16 11:15:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-16 11:15:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:15:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-16 11:15:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-11-16 11:15:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-16 11:15:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-11-16 11:15:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:15:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-16 11:15:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:15:24,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102704257] [2022-11-16 11:15:24,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102704257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:15:24,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199118115] [2022-11-16 11:15:24,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:15:24,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:15:24,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:15:24,739 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:15:24,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:16:39,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:16:39,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:16:39,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-16 11:16:39,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:16:39,254 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-16 11:16:39,317 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-16 11:16:39,907 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-16 11:16:39,914 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1340 (Array Int Int))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1340))) is different from true [2022-11-16 11:16:39,983 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-16 11:16:39,987 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-16 11:16:40,038 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:16:40,038 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-16 11:16:40,045 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-16 11:16:40,190 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-16 11:16:40,325 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-16 11:16:40,507 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:16:40,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 11:16:41,233 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-16 11:16:41,756 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:16:41,756 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-16 11:16:42,784 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-16 11:16:43,231 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-16 11:16:43,251 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-16 11:16:43,504 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-16 11:16:43,524 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-16 11:16:43,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:16:43,562 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-16 11:16:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 27 trivial. 2 not checked. [2022-11-16 11:16:43,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:16:45,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_usb_acecad_probe_~id#1.offset| Int) (v_ArrVal_1350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_usb_acecad_probe_~input_dev~0#1.base| v_ArrVal_1350) |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-16 11:16:45,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199118115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:45,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:16:45,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 44] total 55 [2022-11-16 11:16:45,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249801399] [2022-11-16 11:16:45,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:16:45,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-16 11:16:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:16:45,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-16 11:16:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2994, Unknown=14, NotChecked=222, Total=3422 [2022-11-16 11:16:45,805 INFO L87 Difference]: Start difference. First operand 3323 states and 4360 transitions. Second operand has 55 states, 51 states have (on average 4.980392156862745) internal successors, (254), 40 states have internal predecessors, (254), 15 states have call successors, (40), 11 states have call predecessors, (40), 15 states have return successors, (40), 20 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-16 11:16:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:16:49,429 INFO L93 Difference]: Finished difference Result 7982 states and 10646 transitions. [2022-11-16 11:16:49,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 11:16:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 4.980392156862745) internal successors, (254), 40 states have internal predecessors, (254), 15 states have call successors, (40), 11 states have call predecessors, (40), 15 states have return successors, (40), 20 states have call predecessors, (40), 15 states have call successors, (40) Word has length 211 [2022-11-16 11:16:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:16:49,451 INFO L225 Difference]: With dead ends: 7982 [2022-11-16 11:16:49,451 INFO L226 Difference]: Without dead ends: 5200 [2022-11-16 11:16:49,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 242 SyntacticMatches, 14 SemanticMatches, 86 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=386, Invalid=6912, Unknown=20, NotChecked=338, Total=7656 [2022-11-16 11:16:49,460 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 713 mSDsluCounter, 7906 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 8265 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1641 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:16:49,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 8265 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1306 Invalid, 0 Unknown, 1641 Unchecked, 1.2s Time] [2022-11-16 11:16:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2022-11-16 11:16:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 3549. [2022-11-16 11:16:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 2831 states have (on average 1.2624514305898975) internal successors, (3574), 2869 states have internal predecessors, (3574), 488 states have call successors, (488), 196 states have call predecessors, (488), 229 states have return successors, (585), 507 states have call predecessors, (585), 487 states have call successors, (585) [2022-11-16 11:16:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4647 transitions. [2022-11-16 11:16:50,002 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4647 transitions. Word has length 211 [2022-11-16 11:16:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:16:50,003 INFO L495 AbstractCegarLoop]: Abstraction has 3549 states and 4647 transitions. [2022-11-16 11:16:50,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 4.980392156862745) internal successors, (254), 40 states have internal predecessors, (254), 15 states have call successors, (40), 11 states have call predecessors, (40), 15 states have return successors, (40), 20 states have call predecessors, (40), 15 states have call successors, (40) [2022-11-16 11:16:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4647 transitions. [2022-11-16 11:16:50,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-16 11:16:50,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:16:50,012 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:16:50,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:16:50,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:16:50,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:16:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:16:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1038377761, now seen corresponding path program 3 times [2022-11-16 11:16:50,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:16:50,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074396816] [2022-11-16 11:16:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:16:50,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:16:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:16:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:16:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:16:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:16:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:16:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:16:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:16:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:16:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:16:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:16:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:16:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:16:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:16:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:16:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:16:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:16:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 11:16:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-16 11:16:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:16:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-16 11:16:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-11-16 11:16:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-11-16 11:16:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:16:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:16:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-16 11:16:51,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:16:51,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074396816] [2022-11-16 11:16:51,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074396816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:16:51,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214554990] [2022-11-16 11:16:51,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:16:51,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:16:51,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:16:51,615 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:16:51,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:17:50,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:17:50,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:17:50,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 1492 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-16 11:17:50,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:17:50,324 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-16 11:17:50,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:17:50,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214554990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:17:50,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:17:50,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 10 [2022-11-16 11:17:50,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351811440] [2022-11-16 11:17:50,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:17:50,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:17:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:17:50,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:17:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:17:50,327 INFO L87 Difference]: Start difference. First operand 3549 states and 4647 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-16 11:17:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:17:51,030 INFO L93 Difference]: Finished difference Result 7485 states and 9952 transitions. [2022-11-16 11:17:51,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:17:51,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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 217 [2022-11-16 11:17:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:17:51,047 INFO L225 Difference]: With dead ends: 7485 [2022-11-16 11:17:51,047 INFO L226 Difference]: Without dead ends: 4703 [2022-11-16 11:17:51,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 258 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:17:51,054 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 96 mSDsluCounter, 1435 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:17:51,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1823 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:17:51,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2022-11-16 11:17:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 3585. [2022-11-16 11:17:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 2867 states have (on average 1.2591559121032438) internal successors, (3610), 2893 states have internal predecessors, (3610), 488 states have call successors, (488), 196 states have call predecessors, (488), 229 states have return successors, (585), 519 states have call predecessors, (585), 487 states have call successors, (585) [2022-11-16 11:17:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 4683 transitions. [2022-11-16 11:17:51,847 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 4683 transitions. Word has length 217 [2022-11-16 11:17:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:17:51,849 INFO L495 AbstractCegarLoop]: Abstraction has 3585 states and 4683 transitions. [2022-11-16 11:17:51,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 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-16 11:17:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 4683 transitions. [2022-11-16 11:17:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-11-16 11:17:51,863 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:17:51,863 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 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] [2022-11-16 11:17:51,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:17:52,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:52,069 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:17:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:17:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash -576159613, now seen corresponding path program 1 times [2022-11-16 11:17:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:17:52,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890683320] [2022-11-16 11:17:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:17:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:17:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:17:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:17:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:17:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:17:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:17:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-16 11:17:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:17:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:58,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 11:17:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 11:17:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-16 11:17:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:58,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:17:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:17:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-11-16 11:17:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 11:17:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:17:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-11-16 11:17:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:17:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-16 11:17:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:17:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-16 11:17:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-11-16 11:17:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-11-16 11:17:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-16 11:17:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:17:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 11 proven. 53 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-16 11:17:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:17:59,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890683320] [2022-11-16 11:17:59,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890683320] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:17:59,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739413269] [2022-11-16 11:17:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:17:59,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:17:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:17:59,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:17:59,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:18:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:00,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 1899 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-16 11:18:00,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:00,628 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-16 11:18:00,706 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-16 11:18:01,352 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-16 11:18:01,366 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1940 (Array Int Int))) (= (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_1940) |c_#memory_int|)) is different from true [2022-11-16 11:18:01,573 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-16 11:18:01,576 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-16 11:18:01,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:01,624 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-16 11:18:01,648 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-16 11:18:01,651 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-16 11:18:01,785 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-16 11:18:01,983 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-16 11:18:02,350 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:18:02,351 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 12 treesize of output 14 [2022-11-16 11:18:03,499 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:18:03,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:18:03,733 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-16 11:18:04,671 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-16 11:18:04,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 11:18:04,950 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:18:04,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 11:18:05,848 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-16 11:18:05,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 11:18:06,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 11:18:07,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 11:18:07,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-16 11:18:07,421 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-16 11:18:07,517 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-16 11:18:07,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:18:07,536 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-16 11:18:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 32 proven. 105 refuted. 0 times theorem prover too weak. 34 trivial. 2 not checked. [2022-11-16 11:18:07,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:18:09,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1951 (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_1951) |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-16 11:18:09,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739413269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:18:09,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:18:09,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 48] total 85 [2022-11-16 11:18:09,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377367248] [2022-11-16 11:18:09,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:18:09,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-11-16 11:18:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:18:09,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-11-16 11:18:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=6572, Unknown=15, NotChecked=330, Total=7310 [2022-11-16 11:18:09,664 INFO L87 Difference]: Start difference. First operand 3585 states and 4683 transitions. Second operand has 85 states, 79 states have (on average 3.3797468354430378) internal successors, (267), 67 states have internal predecessors, (267), 28 states have call successors, (44), 12 states have call predecessors, (44), 22 states have return successors, (45), 33 states have call predecessors, (45), 28 states have call successors, (45) [2022-11-16 11:18:23,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:23,320 INFO L93 Difference]: Finished difference Result 8837 states and 11803 transitions. [2022-11-16 11:18:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 11:18:23,321 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 79 states have (on average 3.3797468354430378) internal successors, (267), 67 states have internal predecessors, (267), 28 states have call successors, (44), 12 states have call predecessors, (44), 22 states have return successors, (45), 33 states have call predecessors, (45), 28 states have call successors, (45) Word has length 223 [2022-11-16 11:18:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:23,344 INFO L225 Difference]: With dead ends: 8837 [2022-11-16 11:18:23,344 INFO L226 Difference]: Without dead ends: 6011 [2022-11-16 11:18:23,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 259 SyntacticMatches, 20 SemanticMatches, 122 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5497 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=814, Invalid=13931, Unknown=25, NotChecked=482, Total=15252 [2022-11-16 11:18:23,357 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 1902 mSDsluCounter, 12301 mSDsCounter, 0 mSdLazyCounter, 7228 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 12725 SdHoareTripleChecker+Invalid, 11156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 7228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3530 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:23,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1924 Valid, 12725 Invalid, 11156 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [398 Valid, 7228 Invalid, 0 Unknown, 3530 Unchecked, 9.4s Time] [2022-11-16 11:18:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2022-11-16 11:18:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 3958. [2022-11-16 11:18:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3160 states have (on average 1.2585443037974684) internal successors, (3977), 3192 states have internal predecessors, (3977), 552 states have call successors, (552), 210 states have call predecessors, (552), 245 states have return successors, (661), 581 states have call predecessors, (661), 551 states have call successors, (661) [2022-11-16 11:18:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 5190 transitions. [2022-11-16 11:18:24,245 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 5190 transitions. Word has length 223 [2022-11-16 11:18:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:24,246 INFO L495 AbstractCegarLoop]: Abstraction has 3958 states and 5190 transitions. [2022-11-16 11:18:24,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 79 states have (on average 3.3797468354430378) internal successors, (267), 67 states have internal predecessors, (267), 28 states have call successors, (44), 12 states have call predecessors, (44), 22 states have return successors, (45), 33 states have call predecessors, (45), 28 states have call successors, (45) [2022-11-16 11:18:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 5190 transitions. [2022-11-16 11:18:24,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-11-16 11:18:24,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:24,256 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:18:24,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:18:24,465 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1571744360, now seen corresponding path program 1 times [2022-11-16 11:18:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:18:24,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427505543] [2022-11-16 11:18:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:18:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:18:25,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:18:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:18:26,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:18:26,919 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:18:26,920 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:18:26,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:18:26,927 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:18:26,933 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:18:27,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:18:27 BoogieIcfgContainer [2022-11-16 11:18:27,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:18:27,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:18:27,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:18:27,328 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:18:27,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:14:48" (3/4) ... [2022-11-16 11:18:27,332 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:18:27,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:18:27,333 INFO L158 Benchmark]: Toolchain (without parser) took 221960.08ms. Allocated memory was 134.2MB in the beginning and 868.2MB in the end (delta: 734.0MB). Free memory was 95.6MB in the beginning and 549.3MB in the end (delta: -453.8MB). Peak memory consumption was 279.7MB. Max. memory is 16.1GB. [2022-11-16 11:18:27,334 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 92.3MB. Free memory was 43.8MB in the beginning and 43.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:18:27,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1191.13ms. Allocated memory is still 134.2MB. Free memory was 95.3MB in the beginning and 55.2MB in the end (delta: 40.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-16 11:18:27,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.86ms. Allocated memory is still 134.2MB. Free memory was 55.2MB in the beginning and 49.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:18:27,335 INFO L158 Benchmark]: Boogie Preprocessor took 184.58ms. Allocated memory is still 134.2MB. Free memory was 49.0MB in the beginning and 98.2MB in the end (delta: -49.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-11-16 11:18:27,335 INFO L158 Benchmark]: RCFGBuilder took 1328.33ms. Allocated memory is still 134.2MB. Free memory was 98.2MB in the beginning and 88.2MB in the end (delta: 10.0MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2022-11-16 11:18:27,336 INFO L158 Benchmark]: TraceAbstraction took 219112.35ms. Allocated memory was 134.2MB in the beginning and 868.2MB in the end (delta: 734.0MB). Free memory was 87.8MB in the beginning and 549.3MB in the end (delta: -461.5MB). Peak memory consumption was 439.1MB. Max. memory is 16.1GB. [2022-11-16 11:18:27,336 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 868.2MB. Free memory is still 549.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:18:27,338 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 92.3MB. Free memory was 43.8MB in the beginning and 43.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1191.13ms. Allocated memory is still 134.2MB. Free memory was 95.3MB in the beginning and 55.2MB in the end (delta: 40.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.86ms. Allocated memory is still 134.2MB. Free memory was 55.2MB in the beginning and 49.0MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 184.58ms. Allocated memory is still 134.2MB. Free memory was 49.0MB in the beginning and 98.2MB in the end (delta: -49.2MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1328.33ms. Allocated memory is still 134.2MB. Free memory was 98.2MB in the beginning and 88.2MB in the end (delta: 10.0MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. * TraceAbstraction took 219112.35ms. Allocated memory was 134.2MB in the beginning and 868.2MB in the end (delta: 734.0MB). Free memory was 87.8MB in the beginning and 549.3MB in the end (delta: -461.5MB). Peak memory consumption was 439.1MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 868.2MB. Free memory is still 549.3MB. 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: 4056]: 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 3349, overapproximation of strlen at line 3775, overapproximation of bitwiseOr at line 3798, overapproximation of bitwiseAnd at line 3403. Possible FailurePath: [L4062] struct urb *usb_urb = (struct urb *)0; [L4060] int SERIAL_STATE = 0; [L3540] int LDV_IN_INTERRUPT = 1; [L3834] struct usb_device_id const __mod_usb_device_table ; [L4061] void *usb_intfdata = (void *)0; [L4067] void (*completeFnInt)(struct urb * ) ; [L3862] int ldv_retval_0 ; [L4063] struct usb_device *usb_dev = (struct usb_device *)0; [L3863] int ldv_retval_1 ; [L4064] int dev_counter = 0; [L4068] void (*completeFnBulk)(struct urb * ) ; [L3541] int ref_cnt ; [L3835-L3840] 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}; [L4059] int INTERF_STATE = 0; [L4065] int completeFnIntCounter = 0; [L4066] int completeFnBulkCounter = 0; [L3545] int ldv_state_variable_0 ; [L3542] int ldv_state_variable_1 ; [L3829-L3833] 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}}; [L3543] int usb_counter ; [L3544] struct usb_interface *usb_acecad_driver_group1 ; 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3877] struct usb_device_id *ldvarg0 ; [L3878] void *tmp ; [L3879] int tmp___0 ; [L3880] int tmp___1 ; [L3881] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=24, \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, calloc(1UL, size)={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=24, tmp={-18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-18446744073709551617: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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3883] tmp = ldv_init_zalloc(24UL) [L3884] ldvarg0 = (struct usb_device_id *)tmp [L3885] FCALL ldv_initialize() [L3886] ldv_state_variable_1 = 0 [L3887] ref_cnt = 0 [L3888] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: [L3934] 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, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3935] COND TRUE ldv_state_variable_0 == 1 [L3936] CALL, EXPR usb_acecad_init() [L3843] int result ; [L3844] int tmp ; [L3846] CALL, EXPR usb_register(& usb_acecad_driver) [L3358] int tmp ; [L3360] CALL, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3977] ldv_func_ret_type ldv_func_res ; [L3978] int tmp ; [L3980] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4352] return __VERIFIER_nondet_int(); [L3980] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3980] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L3981] ldv_func_res = tmp [L3982] ldv_state_variable_1 = 1 [L3983] usb_counter = 0 [L3984] CALL ldv_usb_driver_1() [L3868] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3494] void *p ; [L3495] void *tmp ; [L3497] 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={36893488147419103235:36893488147419103255}, calloc(1UL, size)={36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3497] tmp = calloc(1UL, size) [L3498] 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={36893488147419103235:36893488147419103255}, calloc(1UL, size)={36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3499] 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={36893488147419103235:36893488147419103255}, calloc(1UL, size)={36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3500] return (p); VAL [={0:0}, ={0:0}, \old(size)=1248, \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={36893488147419103235:36893488147419103255}, calloc(1UL, size)={36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={36893488147419103233:0}, ref_cnt=0, SERIAL_STATE=0, size=1248, tmp={36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={36893488147419103233: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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={0:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3870] tmp = ldv_init_zalloc(1248UL) [L3871] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3984] RET ldv_usb_driver_1() [L3985] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={14:0}, ldv_func_arg1={14:0}, ldv_func_arg2={36893488147419103235:36893488147419103255}, ldv_func_arg2={36893488147419103235:36893488147419103255}, 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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3360] RET, EXPR ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3360] tmp = ldv_usb_register_driver_2(driver, & __this_module, "acecad") [L3361] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={14:0}, driver={14: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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3846] RET, EXPR usb_register(& usb_acecad_driver) [L3846] tmp = usb_register(& usb_acecad_driver) [L3847] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3848] COND TRUE result == 0 [L3852] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3936] RET, EXPR usb_acecad_init() [L3936] ldv_retval_1 = usb_acecad_init() [L3937] COND TRUE ldv_retval_1 == 0 [L3938] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3941] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3893] COND TRUE ldv_state_variable_1 != 0 [L3894] tmp___1 = __VERIFIER_nondet_int() [L3896] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3897] COND TRUE ldv_state_variable_1 == 1 [L3898] CALL, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3690] struct usb_device *dev ; [L3691] struct usb_device *tmp ; [L3692] struct usb_host_interface *interface ; [L3693] struct usb_endpoint_descriptor *endpoint ; [L3694] struct usb_acecad *acecad ; [L3695] struct input_dev *input_dev ; [L3696] int pipe ; [L3697] int maxp ; [L3698] int err ; [L3699] int tmp___0 ; [L3700] unsigned int tmp___1 ; [L3701] __u16 tmp___2 ; [L3702] void *tmp___3 ; [L3703] void *tmp___4 ; [L3704] size_t tmp___5 ; [L3705] size_t tmp___6 ; [L3707] CALL, EXPR interface_to_usbdev(intf) [L3968] struct usb_device *tmp ; [L3970] CALL, EXPR ldv_interface_to_usbdev() [L4172] void *result ; [L4173] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1822, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1822, tmp={-36893488147419103231:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct usb_device))={-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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4175] tmp = ldv_malloc(sizeof(struct usb_device)) [L4176] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4177] COND FALSE !((unsigned long )result == (unsigned long )((void *)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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4181] return ((struct usb_device *)result); VAL [={0:0}, ={0:0}, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-36893488147419103231:0}, SERIAL_STATE=0, tmp={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3970] RET, EXPR ldv_interface_to_usbdev() [L3970] tmp = ldv_interface_to_usbdev() [L3971] return (tmp); VAL [={0:0}, ={0:0}, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, intf={36893488147419103233:0}, intf={36893488147419103233: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={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3707] RET, EXPR interface_to_usbdev(intf) [L3707] tmp = interface_to_usbdev(intf) [L3708] dev = tmp [L3709] EXPR intf->cur_altsetting [L3709] interface = intf->cur_altsetting [L3710] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, interface->desc.bNumEndpoints=-255, intf={36893488147419103233:0}, intf={36893488147419103233: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={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3710] COND FALSE !((unsigned int )interface->desc.bNumEndpoints != 1U) [L3714] EXPR interface->endpoint [L3714] endpoint = & (interface->endpoint)->desc [L3715] CALL, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3313] int tmp ; [L3314] int tmp___0 ; [L3315] int tmp___1 ; [L3317] CALL, EXPR usb_endpoint_xfer_int(epd) [L3308] EXPR epd->bmAttributes [L3308] return (((int )epd->bmAttributes & 3) == 3); [L3317] RET, EXPR usb_endpoint_xfer_int(epd) [L3317] tmp = usb_endpoint_xfer_int(epd) [L3318] COND TRUE tmp != 0 [L3319] CALL, EXPR usb_endpoint_dir_in(epd) [L3302] EXPR epd->bEndpointAddress [L3302] return ((int )((signed char )epd->bEndpointAddress) < 0); [L3319] RET, EXPR usb_endpoint_dir_in(epd) [L3319] tmp___0 = usb_endpoint_dir_in(epd) [L3320] COND TRUE tmp___0 != 0 [L3321] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={-2:19}, epd={-2:19}, 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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3328] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epd={-2:19}, epd={-2:19}, 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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3715] RET, EXPR usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3715] tmp___0 = usb_endpoint_is_int_in((struct usb_endpoint_descriptor const *)endpoint) [L3716] COND FALSE !(tmp___0 == 0) [L3720] EXPR endpoint->bEndpointAddress [L3720] CALL, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3380] EXPR dev->devnum [L3380] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3720] RET, EXPR __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3720] tmp___1 = __create_pipe(dev, (unsigned int )endpoint->bEndpointAddress) [L3721] pipe = (int )(tmp___1 | 1073741952U) [L3722] CALL, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3385] struct usb_host_endpoint *ep ; [L3386] unsigned int epnum ; [L3387] int __ret_warn_on ; [L3388] long tmp ; [L3389] int __ret_warn_on___0 ; [L3390] long tmp___0 ; VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3392] epnum = (unsigned int )(pipe >> 15) & 15U VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3393] COND FALSE !(is_out != 0) [L3403] __ret_warn_on___0 = (pipe & 128) == 0 VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] CALL, EXPR ldv__builtin_expect(__ret_warn_on___0 != 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3537] 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={36893488147419103235:36893488147419103255}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] RET, EXPR ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3404] tmp___0 = ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) [L3405] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3409] CALL ldv__builtin_expect(__ret_warn_on___0 != 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3537] 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={36893488147419103235:36893488147419103255}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3409] RET ldv__builtin_expect(__ret_warn_on___0 != 0, 0L) VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, epnum=0, INTERF_STATE=0, is_out=0, ldv__builtin_expect(__ret_warn_on___0 != 0, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3410] EXPR udev->ep_in[epnum] [L3410] ep = udev->ep_in[epnum] [L3412] COND TRUE (unsigned long )ep == (unsigned long )((struct usb_host_endpoint *)0) [L3413] return (0U); VAL [={0:0}, ={0:0}, \old(is_out)=0, \old(pipe)=32767, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __ret_warn_on___0=0, __this_module={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, ep={18446744073709551593:23}, epnum=0, INTERF_STATE=0, is_out=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp___0=0, udev={-36893488147419103231:0}, udev={-36893488147419103231:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3722] RET, EXPR usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3722] tmp___2 = usb_maxpacket(dev, pipe, (pipe & 128) == 0) [L3723] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3444] void *tmp ; [L3446] CALL, EXPR kmalloc(size, flags | 32768U) [L3435] void *tmp___1 ; [L3437] CALL, EXPR __kmalloc(size, flags) [L3430] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-2:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-2:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-2:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-2:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=232, \result={-2:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={-2:0}, ref_cnt=0, SERIAL_STATE=0, size=232, tmp={-2:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-2: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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] return ldv_malloc(size); [L3437] RET, EXPR __kmalloc(size, flags) [L3437] tmp___1 = __kmalloc(size, flags) [L3438] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=232, \result={-2:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32768, 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={-2:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3446] RET, EXPR kmalloc(size, flags | 32768U) [L3446] tmp = kmalloc(size, flags | 32768U) [L3447] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=232, \result={-2:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, 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={-2:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, kzalloc(232UL, 208U)={-2:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3724] tmp___3 = kzalloc(232UL, 208U) [L3725] acecad = (struct usb_acecad *)tmp___3 [L3726] CALL, EXPR input_allocate_device() [L3548] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3444] void *tmp ; [L3446] CALL, EXPR kmalloc(size, flags | 32768U) [L3435] void *tmp___1 ; [L3437] CALL, EXPR __kmalloc(size, flags) [L3430] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1855, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1855, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=1855, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=1855, tmp={-18446744073709551615:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-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, size=1855, t=32768, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3430] return ldv_malloc(size); [L3437] RET, EXPR __kmalloc(size, flags) [L3437] tmp___1 = __kmalloc(size, flags) [L3438] return (tmp___1); VAL [={0:0}, ={0:0}, \old(flags)=32768, \old(size)=1855, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32768, 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={-18446744073709551615:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3446] RET, EXPR kmalloc(size, flags | 32768U) [L3446] tmp = kmalloc(size, flags | 32768U) [L3447] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=128, \old(size)=1855, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=128, 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={-18446744073709551615:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3548] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u)={-18446744073709551615: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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3548] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L3726] RET, EXPR input_allocate_device() [L3726] input_dev = input_allocate_device() [L3727] COND FALSE !((unsigned long )acecad == (unsigned long )((struct usb_acecad *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L3732] CALL, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L4339] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=0, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=0, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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=0, tmp={-36893488147419103233:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4339] 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={36893488147419103235:36893488147419103255}, arg0={-36893488147419103231:0}, arg0={-36893488147419103231:0}, arg1=8, arg2=208, arg3={-2:224}, arg3={-2:224}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4339] return ldv_malloc(0UL); [L3732] RET, EXPR usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3732] tmp___4 = usb_alloc_coherent(dev, 8UL, 208U, & acecad->data_dma) [L3733] acecad->data = (unsigned char *)tmp___4 [L3734] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, acecad->data={-36893488147419103233:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3734] COND FALSE !((unsigned long )acecad->data == (unsigned long )((unsigned char *)0U)) [L3739] CALL, EXPR ldv_usb_alloc_urb_5(0, 208U) [L4006] struct urb *tmp ; [L4008] CALL, EXPR ldv_alloc_urb() [L4091] struct urb *value ; [L4092] void *tmp ; [L4093] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3460] void *p ; [L3461] void *tmp ; [L3462] int tmp___0 ; [L3464] tmp___0 = __VERIFIER_nondet_int() [L3465] COND FALSE !(tmp___0 != 0) [L3468] tmp = malloc(size) [L3469] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={18446744073709551617:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3456] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3470] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={18446744073709551617:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3471] return (p); VAL [={0:0}, ={0:0}, \old(size)=180, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=180, tmp={18446744073709551617:0}, tmp___0=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={18446744073709551617: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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4095] tmp = ldv_malloc(sizeof(struct urb)) [L4096] value = (struct urb *)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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={18446744073709551617:0}] [L4097] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3513] int tmp ; [L3515] tmp = __VERIFIER_nondet_int() [L3516] return (tmp); 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4097] 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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()=1, ref_cnt=0, SERIAL_STATE=0, tmp={18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={18446744073709551617:0}] [L4097] tmp___0 = ldv_undef_int() [L4098] COND TRUE 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}, value={18446744073709551617:0}] [L4099] COND TRUE (unsigned long )value != (unsigned long )((struct urb *)0) [L4100] usb_urb = value 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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}, value={18446744073709551617:0}] [L4105] return (usb_urb); VAL [={0:0}, ={0:0}, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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={18446744073709551617:0}, tmp___0=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}, value={18446744073709551617:0}] [L4008] RET, EXPR ldv_alloc_urb() [L4008] tmp = ldv_alloc_urb() [L4009] return (tmp); VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, \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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, mem_flags=208, ref_cnt=0, SERIAL_STATE=0, tmp={18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3739] RET, EXPR ldv_usb_alloc_urb_5(0, 208U) [L3739] acecad->irq = ldv_usb_alloc_urb_5(0, 208U) [L3740] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, acecad->irq={18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3740] COND FALSE !((unsigned long )acecad->irq == (unsigned long )((struct urb *)0)) [L3745] acecad->usbdev = dev [L3746] acecad->input = input_dev [L3747] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev->manufacturer={27:18446744073709551589}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3747] COND FALSE !((unsigned long )dev->manufacturer != (unsigned long )((char *)0)) [L3751] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev->product={29:18446744073709551587}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3751] COND FALSE !((unsigned long )dev->product != (unsigned long )((char *)0)) [L3759] CALL usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3347] int actual ; [L3349] EXPR dev->bus [L3349] EXPR (dev->bus)->bus_name [L3349] actual = snprintf(buf, size, "usb-%s-%s", (dev->bus)->bus_name, (char *)(& dev->devpath)) [L3350] 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={36893488147419103235:36893488147419103255}, actual=-1, buf={-2:128}, buf={-2:128}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev={-36893488147419103231:0}, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3759] RET usb_make_path(dev, (char *)(& acecad->phys), 64UL) [L3760] 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={36893488147419103235:36893488147419103255}, arg0={-2:128}, arg1={9:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L4332] return __VERIFIER_nondet_ulong(); [L3760] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, strlcat((char *)(& acecad->phys), "/input0", 64UL)=36893488147419103237, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3761] input_dev->name = (char const *)(& acecad->name) [L3762] input_dev->phys = (char const *)(& acecad->phys) [L3763] CALL usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3597] id->bustype = 3U [L3598] EXPR dev->descriptor.idVendor [L3598] id->vendor = dev->descriptor.idVendor [L3599] EXPR dev->descriptor.idProduct [L3599] id->product = dev->descriptor.idProduct [L3600] EXPR dev->descriptor.bcdDevice [L3600] id->version = dev->descriptor.bcdDevice [L3763] RET usb_to_input_id((struct usb_device const *)dev, & input_dev->id) [L3764] input_dev->dev.parent = & intf->dev [L3765] CALL input_set_drvdata(input_dev, (void *)acecad) [L3562] FCALL dev_set_drvdata(& dev->dev, data) [L3765] RET input_set_drvdata(input_dev, (void *)acecad) [L3766] input_dev->open = & usb_acecad_open [L3767] input_dev->close = & usb_acecad_close [L3768] input_dev->evbit[0] = 10UL [L3769] input_dev->keybit[5] = 7169UL [L3770] id->driver_info [L3771] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3772] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3773] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3774] 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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3775] tmp___5 = strlen((char const *)(& acecad->name)) [L3776] COND TRUE tmp___5 == 0UL [L3778] dev->descriptor.idVendor [L3778] dev->descriptor.idProduct [L3795] EXPR acecad->irq [L3795] EXPR acecad->data [L3796] EXPR endpoint->bInterval [L3795-L3796] 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) [L4018] CALL ldv_fill_int_urb(urb, complete_fn) [L4121] COND TRUE (unsigned long )usb_urb == (unsigned long )urb [L4122] completeFnInt = complete_fn [L4123] completeFnIntCounter = completeFnIntCounter + 1 VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, complete_fn={-1:2}, complete_fn={-1:2}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={18446744073709551617:0}, urb={18446744073709551617:0}, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L4018] RET ldv_fill_int_urb(urb, complete_fn) [L3795-L3796] 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) [L3797] EXPR acecad->irq [L3797] EXPR acecad->data_dma [L3797] (acecad->irq)->transfer_dma = acecad->data_dma [L3798] EXPR acecad->irq [L3798] EXPR acecad->irq [L3798] EXPR (acecad->irq)->transfer_flags [L3798] (acecad->irq)->transfer_flags = (acecad->irq)->transfer_flags | 4U [L3799] EXPR acecad->input [L3799] CALL, EXPR input_register_device(acecad->input) [L4315] return __VERIFIER_nondet_int(); [L3799] RET, EXPR input_register_device(acecad->input) [L3799] err = input_register_device(acecad->input) [L3800] COND TRUE err != 0 VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3807] EXPR acecad->data [L3807] EXPR acecad->data_dma VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, acecad={-2:0}, acecad->data={-36893488147419103233:0}, acecad->data_dma=36893488147419103254, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3807] FCALL usb_free_coherent(dev, 8UL, (void *)acecad->data, acecad->data_dma) VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, acecad={-2:0}, acecad->data={-36893488147419103233:0}, acecad->data_dma=36893488147419103254, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3809] FCALL input_free_device(input_dev) [L3810] CALL kfree((void const *)acecad) VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-2:0}, ref_cnt=0, SERIAL_STATE=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3810] RET kfree((void const *)acecad) VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3811] return (err); VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, acecad={-2:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev={-36893488147419103231:0}, dev_counter=0, endpoint={-2:19}, err=1, id={-18446744073709551617:0}, id={-18446744073709551617:0}, id->driver_info=0, input_dev={-18446744073709551615:0}, INTERF_STATE=0, interface={36893488147419103241:-12}, intf={36893488147419103233:0}, intf={36893488147419103233:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, maxp=0, pipe=32767, ref_cnt=0, SERIAL_STATE=0, tmp={-36893488147419103231:0}, tmp___0=1, tmp___1=4227072, tmp___2=0, tmp___3={-2:0}, tmp___4={-36893488147419103233:0}, tmp___5=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3898] RET, EXPR usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3898] ldv_retval_0 = usb_acecad_probe(usb_acecad_driver_group1, (struct usb_device_id const *)ldvarg0) [L3899] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3890] tmp___0 = __VERIFIER_nondet_int() [L3892] case 0: [L3922] case 1: VAL [={0:0}, ={-1:2}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=1, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3923] COND TRUE ldv_state_variable_0 != 0 [L3924] tmp___2 = __VERIFIER_nondet_int() [L3926] case 0: VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3927] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L3928] CALL usb_acecad_exit() [L3858] CALL ldv_usb_deregister_11(& usb_acecad_driver) [L4047] FCALL usb_deregister(arg) [L4048] ldv_state_variable_1 = 0 VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, arg={14:0}, arg={14:0}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3858] RET ldv_usb_deregister_11(& usb_acecad_driver) [L3928] RET usb_acecad_exit() [L3929] ldv_state_variable_0 = 2 VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L3962] CALL ldv_check_final_state() [L4278] COND TRUE (unsigned long )usb_urb != (unsigned long )((struct urb *)0) VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L4279] CALL ldv_error() VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] [L4056] reach_error() VAL [={-1:2}, ={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={36893488147419103235:36893488147419103255}, completeFnBulkCounter=0, completeFnIntCounter=1, dev_counter=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, usb_acecad_driver={14:0}, usb_acecad_driver_group1={36893488147419103233:0}, usb_acecad_id_table={15:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={18446744073709551617:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 218.6s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9299 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8946 mSDsluCounter, 49023 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6920 IncrementalHoareTripleChecker+Unchecked, 42245 mSDsCounter, 1986 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13958 IncrementalHoareTripleChecker+Invalid, 22864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1986 mSolverCounterUnsat, 6778 mSDtfsCounter, 13958 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2759 GetRequests, 2286 SyntacticMatches, 55 SemanticMatches, 418 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9100 ImplicationChecksByTransitivity, 22.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3958occurred in iteration=20, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 12309 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 135.8s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 4678 NumberOfCodeBlocks, 4485 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4414 ConstructedInterpolants, 241 QuantifiedInterpolants, 16773 SizeOfPredicates, 138 NumberOfNonLiveVariables, 13572 ConjunctsInSsa, 524 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 1880/2200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:18:27,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-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_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:18:30,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:18:30,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:18:30,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:18:30,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:18:30,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:18:30,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:18:30,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:18:30,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:18:30,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:18:30,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:18:30,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:18:30,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:18:30,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:18:30,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:18:30,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:18:30,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:18:30,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:18:30,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:18:30,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:18:30,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:18:30,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:18:30,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:18:30,245 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:18:30,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:18:30,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:18:30,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:18:30,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:18:30,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:18:30,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:18:30,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:18:30,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:18:30,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:18:30,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:18:30,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:18:30,268 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:18:30,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:18:30,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:18:30,270 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:18:30,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:18:30,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:18:30,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 11:18:30,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:18:30,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:18:30,338 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:18:30,338 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:18:30,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:18:30,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:18:30,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:18:30,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:18:30,342 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:18:30,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:18:30,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:18:30,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:18:30,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:18:30,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:18:30,345 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:18:30,346 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:18:30,346 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:18:30,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:18:30,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:18:30,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:18:30,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:18:30,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:18:30,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:18:30,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:18:30,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:18:30,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:18:30,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:18:30,350 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:18:30,350 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:18:30,350 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:18:30,351 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:18:30,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:18:30,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:18:30,352 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_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 07ae4eb392cc9822cbd398c1edf107cccc60d6668bc59dbf5a692a6b9350873b [2022-11-16 11:18:30,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:18:30,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:18:30,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:18:30,853 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:18:30,856 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:18:30,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 11:18:30,947 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/4da883aa3/38918fe8e8aa4defa418eeafa8d15821/FLAG460e856ab [2022-11-16 11:18:31,816 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:18:31,817 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 11:18:31,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/4da883aa3/38918fe8e8aa4defa418eeafa8d15821/FLAG460e856ab [2022-11-16 11:18:32,379 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/data/4da883aa3/38918fe8e8aa4defa418eeafa8d15821 [2022-11-16 11:18:32,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:18:32,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:18:32,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:18:32,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:18:32,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:18:32,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:18:32" (1/1) ... [2022-11-16 11:18:32,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d347899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:32, skipping insertion in model container [2022-11-16 11:18:32,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:18:32" (1/1) ... [2022-11-16 11:18:32,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:18:32,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:18:33,719 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-16 11:18:33,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:18:33,861 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-16 11:18:33,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:18:34,131 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-16 11:18:34,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:18:34,163 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:18:34,390 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i[113497,113510] [2022-11-16 11:18:34,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:18:34,502 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:18:34,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34 WrapperNode [2022-11-16 11:18:34,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:18:34,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:18:34,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:18:34,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:18:34,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,666 INFO L138 Inliner]: procedures = 116, calls = 317, calls flagged for inlining = 47, calls inlined = 41, statements flattened = 740 [2022-11-16 11:18:34,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:18:34,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:18:34,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:18:34,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:18:34,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,792 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:18:34,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:18:34,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:18:34,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:18:34,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (1/1) ... [2022-11-16 11:18:34,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:18:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:18:34,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:18:34,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:18:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-16 11:18:34,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-16 11:18:34,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-16 11:18:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-16 11:18:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 11:18:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 11:18:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 11:18:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 11:18:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 11:18:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 11:18:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 11:18:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 11:18:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-16 11:18:34,927 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-16 11:18:34,927 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-16 11:18:34,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-16 11:18:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 11:18:34,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 11:18:34,928 INFO L130 BoogieDeclarations]: Found specification of procedure usb_acecad_disconnect [2022-11-16 11:18:34,928 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_acecad_disconnect [2022-11-16 11:18:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-11-16 11:18:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-11-16 11:18:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-16 11:18:34,929 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-16 11:18:34,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:18:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:18:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-16 11:18:34,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-16 11:18:34,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:18:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-16 11:18:34,931 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-16 11:18:34,931 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-16 11:18:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-16 11:18:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_7 [2022-11-16 11:18:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_7 [2022-11-16 11:18:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:18:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-16 11:18:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-16 11:18:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:18:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:18:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:18:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-16 11:18:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-16 11:18:34,934 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-16 11:18:34,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:18:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-16 11:18:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-16 11:18:34,935 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-16 11:18:34,936 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-16 11:18:34,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:18:34,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:18:35,451 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:18:35,453 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:18:35,547 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 11:18:42,483 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:18:42,535 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:18:42,535 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:18:42,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:18:42 BoogieIcfgContainer [2022-11-16 11:18:42,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:18:42,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:18:42,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:18:42,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:18:42,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:18:32" (1/3) ... [2022-11-16 11:18:42,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aef6ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:18:42, skipping insertion in model container [2022-11-16 11:18:42,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:18:34" (2/3) ... [2022-11-16 11:18:42,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aef6ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:18:42, skipping insertion in model container [2022-11-16 11:18:42,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:18:42" (3/3) ... [2022-11-16 11:18:42,551 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-11-16 11:18:42,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:18:42,585 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:18:42,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:18:42,688 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;@37c858b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:18:42,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:18:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 179 states have internal predecessors, (218), 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-16 11:18:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:18:42,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:42,710 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-16 11:18:42,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash -844282775, now seen corresponding path program 1 times [2022-11-16 11:18:42,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:42,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566845115] [2022-11-16 11:18:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:42,743 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:42,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:42,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:18:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:43,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:18:43,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:18:43,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:43,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:43,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566845115] [2022-11-16 11:18:43,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566845115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:43,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:43,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:18:43,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210889633] [2022-11-16 11:18:43,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:43,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:18:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:18:43,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:18:43,338 INFO L87 Difference]: Start difference. First operand has 227 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 179 states have internal predecessors, (218), 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-16 11:18:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:43,461 INFO L93 Difference]: Finished difference Result 449 states and 605 transitions. [2022-11-16 11:18:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:18:43,465 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-16 11:18:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:43,478 INFO L225 Difference]: With dead ends: 449 [2022-11-16 11:18:43,478 INFO L226 Difference]: Without dead ends: 216 [2022-11-16 11:18:43,484 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-16 11:18:43,489 INFO L413 NwaCegarLoop]: 292 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, 292 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:43,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:18:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-16 11:18:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-16 11:18:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 162 states have (on average 1.271604938271605) internal successors, (206), 168 states have internal predecessors, (206), 39 states have call successors, (39), 15 states have call predecessors, (39), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-11-16 11:18:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 279 transitions. [2022-11-16 11:18:43,575 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 279 transitions. Word has length 32 [2022-11-16 11:18:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:43,576 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 279 transitions. [2022-11-16 11:18:43,576 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-16 11:18:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 279 transitions. [2022-11-16 11:18:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:18:43,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:43,579 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-16 11:18:43,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:43,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:43,790 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash -421580949, now seen corresponding path program 1 times [2022-11-16 11:18:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610243443] [2022-11-16 11:18:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:43,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:43,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:43,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:43,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:18:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:44,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:18:44,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:18:44,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:44,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:44,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610243443] [2022-11-16 11:18:44,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610243443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:44,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:44,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:18:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393357754] [2022-11-16 11:18:44,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:44,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:44,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:44,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:44,271 INFO L87 Difference]: Start difference. First operand 216 states and 279 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-16 11:18:44,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:44,473 INFO L93 Difference]: Finished difference Result 612 states and 793 transitions. [2022-11-16 11:18:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:44,474 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-16 11:18:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:44,483 INFO L225 Difference]: With dead ends: 612 [2022-11-16 11:18:44,483 INFO L226 Difference]: Without dead ends: 401 [2022-11-16 11:18:44,489 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-16 11:18:44,491 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 244 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 575 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-16 11:18:44,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 575 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:18:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-11-16 11:18:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2022-11-16 11:18:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 301 states have (on average 1.2624584717607974) internal successors, (380), 309 states have internal predecessors, (380), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-16 11:18:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 517 transitions. [2022-11-16 11:18:44,576 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 517 transitions. Word has length 32 [2022-11-16 11:18:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:44,576 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 517 transitions. [2022-11-16 11:18:44,577 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-16 11:18:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 517 transitions. [2022-11-16 11:18:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:18:44,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:44,580 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-16 11:18:44,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:44,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:44,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:44,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1120918184, now seen corresponding path program 1 times [2022-11-16 11:18:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:44,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812487656] [2022-11-16 11:18:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:44,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:44,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:18:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:45,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:18:45,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:45,359 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-16 11:18:45,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:45,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:45,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812487656] [2022-11-16 11:18:45,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812487656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:45,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:45,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:18:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395347342] [2022-11-16 11:18:45,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:45,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:18:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:18:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:18:45,364 INFO L87 Difference]: Start difference. First operand 401 states and 517 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-16 11:18:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:45,789 INFO L93 Difference]: Finished difference Result 936 states and 1236 transitions. [2022-11-16 11:18:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:18:45,790 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-16 11:18:45,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:45,794 INFO L225 Difference]: With dead ends: 936 [2022-11-16 11:18:45,795 INFO L226 Difference]: Without dead ends: 550 [2022-11-16 11:18:45,796 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-16 11:18:45,797 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 604 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:45,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 1089 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:18:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-16 11:18:45,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 404. [2022-11-16 11:18:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 304 states have (on average 1.256578947368421) internal successors, (382), 312 states have internal predecessors, (382), 71 states have call successors, (71), 29 states have call predecessors, (71), 28 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-11-16 11:18:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 519 transitions. [2022-11-16 11:18:45,859 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 519 transitions. Word has length 55 [2022-11-16 11:18:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:45,860 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 519 transitions. [2022-11-16 11:18:45,861 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-16 11:18:45,861 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 519 transitions. [2022-11-16 11:18:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:18:45,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:45,874 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-16 11:18:45,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:46,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:46,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash -440859814, now seen corresponding path program 1 times [2022-11-16 11:18:46,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:46,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284857002] [2022-11-16 11:18:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:46,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:46,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:46,096 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:46,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:18:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:46,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:18:46,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:47,149 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-16 11:18:47,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:47,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284857002] [2022-11-16 11:18:47,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284857002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:47,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:47,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:18:47,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249726705] [2022-11-16 11:18:47,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:47,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:47,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:47,153 INFO L87 Difference]: Start difference. First operand 404 states and 519 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-16 11:18:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:47,362 INFO L93 Difference]: Finished difference Result 1181 states and 1528 transitions. [2022-11-16 11:18:47,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:47,364 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-16 11:18:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:47,371 INFO L225 Difference]: With dead ends: 1181 [2022-11-16 11:18:47,372 INFO L226 Difference]: Without dead ends: 792 [2022-11-16 11:18:47,373 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-16 11:18:47,374 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 237 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:47,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:18:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-11-16 11:18:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 782. [2022-11-16 11:18:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 593 states have (on average 1.2529510961214165) internal successors, (743), 605 states have internal predecessors, (743), 134 states have call successors, (134), 55 states have call predecessors, (134), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:18:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1008 transitions. [2022-11-16 11:18:47,493 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1008 transitions. Word has length 55 [2022-11-16 11:18:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:47,494 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1008 transitions. [2022-11-16 11:18:47,495 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-16 11:18:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1008 transitions. [2022-11-16 11:18:47,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-16 11:18:47,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:47,497 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-16 11:18:47,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:47,715 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:47,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -781748368, now seen corresponding path program 1 times [2022-11-16 11:18:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:47,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325951974] [2022-11-16 11:18:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:47,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:47,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:47,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:47,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:18:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:18:48,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:48,664 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-16 11:18:48,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:48,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:48,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325951974] [2022-11-16 11:18:48,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325951974] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:48,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:48,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:18:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647641976] [2022-11-16 11:18:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:48,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:48,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:48,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:48,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:48,667 INFO L87 Difference]: Start difference. First operand 782 states and 1008 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-16 11:18:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:48,829 INFO L93 Difference]: Finished difference Result 784 states and 1009 transitions. [2022-11-16 11:18:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:48,831 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-16 11:18:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:48,835 INFO L225 Difference]: With dead ends: 784 [2022-11-16 11:18:48,836 INFO L226 Difference]: Without dead ends: 781 [2022-11-16 11:18:48,837 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-16 11:18:48,837 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 276 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-16 11:18:48,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 276 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:18:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2022-11-16 11:18:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2022-11-16 11:18:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 593 states have (on average 1.2512647554806071) internal successors, (742), 604 states have internal predecessors, (742), 133 states have call successors, (133), 55 states have call predecessors, (133), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:18:48,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1006 transitions. [2022-11-16 11:18:48,997 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1006 transitions. Word has length 56 [2022-11-16 11:18:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:48,997 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1006 transitions. [2022-11-16 11:18:48,997 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-16 11:18:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1006 transitions. [2022-11-16 11:18:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:18:49,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:49,001 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-16 11:18:49,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:49,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:49,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:49,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1535613213, now seen corresponding path program 1 times [2022-11-16 11:18:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:49,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010977542] [2022-11-16 11:18:49,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:49,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:49,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:49,232 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:49,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:18:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:49,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:18:49,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:49,917 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-16 11:18:49,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:49,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:49,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010977542] [2022-11-16 11:18:49,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010977542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:49,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:49,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:18:49,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455553736] [2022-11-16 11:18:49,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:49,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:49,920 INFO L87 Difference]: Start difference. First operand 781 states and 1006 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-16 11:18:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:50,075 INFO L93 Difference]: Finished difference Result 783 states and 1007 transitions. [2022-11-16 11:18:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:50,076 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-16 11:18:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:50,084 INFO L225 Difference]: With dead ends: 783 [2022-11-16 11:18:50,084 INFO L226 Difference]: Without dead ends: 780 [2022-11-16 11:18:50,085 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-16 11:18:50,086 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 274 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-16 11:18:50,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 274 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:18:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-16 11:18:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2022-11-16 11:18:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 593 states have (on average 1.2495784148397977) internal successors, (741), 603 states have internal predecessors, (741), 132 states have call successors, (132), 55 states have call predecessors, (132), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:18:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1004 transitions. [2022-11-16 11:18:50,264 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1004 transitions. Word has length 57 [2022-11-16 11:18:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:50,265 INFO L495 AbstractCegarLoop]: Abstraction has 780 states and 1004 transitions. [2022-11-16 11:18:50,265 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-16 11:18:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1004 transitions. [2022-11-16 11:18:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:18:50,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:50,272 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-16 11:18:50,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:50,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:50,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash 359383059, now seen corresponding path program 1 times [2022-11-16 11:18:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496360512] [2022-11-16 11:18:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:50,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:50,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:50,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:50,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-16 11:18:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:50,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:18:50,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:51,107 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-16 11:18:51,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:51,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:51,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496360512] [2022-11-16 11:18:51,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496360512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:51,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:51,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:18:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262016072] [2022-11-16 11:18:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:51,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:51,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:51,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:51,110 INFO L87 Difference]: Start difference. First operand 780 states and 1004 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-16 11:18:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:51,278 INFO L93 Difference]: Finished difference Result 782 states and 1005 transitions. [2022-11-16 11:18:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:51,279 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-16 11:18:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:51,285 INFO L225 Difference]: With dead ends: 782 [2022-11-16 11:18:51,285 INFO L226 Difference]: Without dead ends: 779 [2022-11-16 11:18:51,286 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-16 11:18:51,292 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 272 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-16 11:18:51,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 272 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:18:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-11-16 11:18:51,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2022-11-16 11:18:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 593 states have (on average 1.2478920741989883) internal successors, (740), 602 states have internal predecessors, (740), 131 states have call successors, (131), 55 states have call predecessors, (131), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:18:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1002 transitions. [2022-11-16 11:18:51,472 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1002 transitions. Word has length 58 [2022-11-16 11:18:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:51,473 INFO L495 AbstractCegarLoop]: Abstraction has 779 states and 1002 transitions. [2022-11-16 11:18:51,473 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-16 11:18:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1002 transitions. [2022-11-16 11:18:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:18:51,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:51,475 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, 1] [2022-11-16 11:18:51,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:51,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:51,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1744008480, now seen corresponding path program 1 times [2022-11-16 11:18:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:51,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220059249] [2022-11-16 11:18:51,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:51,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:51,697 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:51,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-16 11:18:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:52,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:18:52,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:52,358 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-16 11:18:52,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:52,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:52,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220059249] [2022-11-16 11:18:52,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220059249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:52,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:52,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:18:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352239709] [2022-11-16 11:18:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:52,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:52,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:52,361 INFO L87 Difference]: Start difference. First operand 779 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-16 11:18:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:52,569 INFO L93 Difference]: Finished difference Result 781 states and 1003 transitions. [2022-11-16 11:18:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:52,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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 59 [2022-11-16 11:18:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:52,574 INFO L225 Difference]: With dead ends: 781 [2022-11-16 11:18:52,574 INFO L226 Difference]: Without dead ends: 769 [2022-11-16 11:18:52,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:52,576 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 228 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:52,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:18:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-11-16 11:18:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2022-11-16 11:18:52,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 584 states have (on average 1.2465753424657535) internal successors, (728), 592 states have internal predecessors, (728), 130 states have call successors, (130), 55 states have call predecessors, (130), 54 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:18:52,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 989 transitions. [2022-11-16 11:18:52,731 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 989 transitions. Word has length 59 [2022-11-16 11:18:52,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:52,733 INFO L495 AbstractCegarLoop]: Abstraction has 769 states and 989 transitions. [2022-11-16 11:18:52,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 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-16 11:18:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 989 transitions. [2022-11-16 11:18:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-16 11:18:52,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:52,742 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:18:52,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:52,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:52,967 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash 534361474, now seen corresponding path program 1 times [2022-11-16 11:18:52,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:52,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326014371] [2022-11-16 11:18:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:52,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:52,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:52,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-16 11:18:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:53,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:18:53,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:53,717 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-16 11:18:53,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:53,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:53,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326014371] [2022-11-16 11:18:53,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326014371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:53,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:53,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:18:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185792890] [2022-11-16 11:18:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:53,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:18:53,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:53,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:18:53,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:53,721 INFO L87 Difference]: Start difference. First operand 769 states and 989 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 11:18:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:53,947 INFO L93 Difference]: Finished difference Result 1587 states and 2049 transitions. [2022-11-16 11:18:53,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:18:53,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2022-11-16 11:18:53,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:53,952 INFO L225 Difference]: With dead ends: 1587 [2022-11-16 11:18:53,952 INFO L226 Difference]: Without dead ends: 833 [2022-11-16 11:18:53,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:18:53,956 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 41 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 521 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-16 11:18:53,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 521 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:18:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-11-16 11:18:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 823. [2022-11-16 11:18:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 637 states have (on average 1.2590266875981162) internal successors, (802), 645 states have internal predecessors, (802), 130 states have call successors, (130), 56 states have call predecessors, (130), 55 states have return successors, (131), 129 states have call predecessors, (131), 129 states have call successors, (131) [2022-11-16 11:18:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1063 transitions. [2022-11-16 11:18:54,092 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1063 transitions. Word has length 159 [2022-11-16 11:18:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:54,093 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1063 transitions. [2022-11-16 11:18:54,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 11:18:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1063 transitions. [2022-11-16 11:18:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-16 11:18:54,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:54,100 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:18:54,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:54,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:54,315 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 71836451, now seen corresponding path program 1 times [2022-11-16 11:18:54,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:54,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871125810] [2022-11-16 11:18:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:54,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:54,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:54,318 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:54,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-16 11:18:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:54,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:18:54,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:55,089 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-16 11:18:55,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:55,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:55,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871125810] [2022-11-16 11:18:55,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871125810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:55,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:55,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:18:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146922359] [2022-11-16 11:18:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:55,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:18:55,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:18:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:18:55,093 INFO L87 Difference]: Start difference. First operand 823 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:18:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:55,339 INFO L93 Difference]: Finished difference Result 1643 states and 2135 transitions. [2022-11-16 11:18:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:18:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2022-11-16 11:18:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:55,345 INFO L225 Difference]: With dead ends: 1643 [2022-11-16 11:18:55,346 INFO L226 Difference]: Without dead ends: 831 [2022-11-16 11:18:55,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:18:55,348 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:18:55,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1054 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:18:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-11-16 11:18:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2022-11-16 11:18:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 641 states have (on average 1.2574102964118565) internal successors, (806), 653 states have internal predecessors, (806), 130 states have call successors, (130), 56 states have call predecessors, (130), 59 states have return successors, (143), 129 states have call predecessors, (143), 129 states have call successors, (143) [2022-11-16 11:18:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1079 transitions. [2022-11-16 11:18:55,545 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1079 transitions. Word has length 168 [2022-11-16 11:18:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:55,546 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1079 transitions. [2022-11-16 11:18:55,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-16 11:18:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1079 transitions. [2022-11-16 11:18:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-16 11:18:55,550 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:55,550 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:18:55,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:18:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:55,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1802056919, now seen corresponding path program 1 times [2022-11-16 11:18:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:55,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679599684] [2022-11-16 11:18:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:55,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:55,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:55,773 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:55,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-16 11:18:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:56,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:18:56,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:56,440 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-16 11:18:56,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:56,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:56,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679599684] [2022-11-16 11:18:56,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679599684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:56,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:56,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:18:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672673730] [2022-11-16 11:18:56,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:56,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:18:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:56,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:18:56,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:18:56,453 INFO L87 Difference]: Start difference. First operand 831 states and 1079 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-16 11:18:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:18:56,763 INFO L93 Difference]: Finished difference Result 2217 states and 2962 transitions. [2022-11-16 11:18:56,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:18:56,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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 174 [2022-11-16 11:18:56,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:18:56,772 INFO L225 Difference]: With dead ends: 2217 [2022-11-16 11:18:56,772 INFO L226 Difference]: Without dead ends: 1405 [2022-11-16 11:18:56,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 172 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-16 11:18:56,777 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 333 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1308 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-16 11:18:56,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1308 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:18:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2022-11-16 11:18:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 843. [2022-11-16 11:18:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 653 states have (on average 1.2526799387442573) internal successors, (818), 665 states have internal predecessors, (818), 130 states have call successors, (130), 56 states have call predecessors, (130), 59 states have return successors, (143), 129 states have call predecessors, (143), 129 states have call successors, (143) [2022-11-16 11:18:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1091 transitions. [2022-11-16 11:18:56,942 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1091 transitions. Word has length 174 [2022-11-16 11:18:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:18:56,942 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 1091 transitions. [2022-11-16 11:18:56,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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-16 11:18:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1091 transitions. [2022-11-16 11:18:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-11-16 11:18:56,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:18:56,947 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:18:56,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-11-16 11:18:57,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:57,170 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:18:57,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:18:57,171 INFO L85 PathProgramCache]: Analyzing trace with hash -419348752, now seen corresponding path program 1 times [2022-11-16 11:18:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:18:57,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401164585] [2022-11-16 11:18:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:18:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:18:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:18:57,173 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:18:57,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-16 11:18:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:18:57,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 11:18:57,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:18:58,174 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-16 11:18:58,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:18:58,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:18:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401164585] [2022-11-16 11:18:58,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401164585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:18:58,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:18:58,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 11:18:58,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648059582] [2022-11-16 11:18:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:18:58,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:18:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:18:58,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:18:58,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:18:58,182 INFO L87 Difference]: Start difference. First operand 843 states and 1091 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 11:19:00,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:19:02,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:19:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:02,320 INFO L93 Difference]: Finished difference Result 2211 states and 2945 transitions. [2022-11-16 11:19:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:19:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) Word has length 176 [2022-11-16 11:19:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:02,329 INFO L225 Difference]: With dead ends: 2211 [2022-11-16 11:19:02,329 INFO L226 Difference]: Without dead ends: 1387 [2022-11-16 11:19:02,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 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-16 11:19:02,333 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 203 mSDsluCounter, 2878 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:02,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 3255 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-11-16 11:19:02,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-11-16 11:19:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 875. [2022-11-16 11:19:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 681 states have (on average 1.2422907488986785) internal successors, (846), 689 states have internal predecessors, (846), 130 states have call successors, (130), 56 states have call predecessors, (130), 63 states have return successors, (151), 137 states have call predecessors, (151), 129 states have call successors, (151) [2022-11-16 11:19:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1127 transitions. [2022-11-16 11:19:02,550 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1127 transitions. Word has length 176 [2022-11-16 11:19:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:02,551 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1127 transitions. [2022-11-16 11:19:02,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 8 states have internal predecessors, (115), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-16 11:19:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1127 transitions. [2022-11-16 11:19:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-16 11:19:02,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:02,555 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:02,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:02,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:02,779 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash 403002934, now seen corresponding path program 2 times [2022-11-16 11:19:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:02,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923732330] [2022-11-16 11:19:02,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:19:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:02,782 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:02,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-16 11:19:03,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:19:03,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:19:03,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 11:19:03,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:03,379 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-16 11:19:03,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:19:03,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:19:03,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923732330] [2022-11-16 11:19:03,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923732330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:19:03,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:19:03,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:19:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367863726] [2022-11-16 11:19:03,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:19:03,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:19:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:19:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:19:03,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:19:03,382 INFO L87 Difference]: Start difference. First operand 875 states and 1127 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-16 11:19:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:05,029 INFO L93 Difference]: Finished difference Result 1917 states and 2506 transitions. [2022-11-16 11:19:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:19:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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 182 [2022-11-16 11:19:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:05,036 INFO L225 Difference]: With dead ends: 1917 [2022-11-16 11:19:05,036 INFO L226 Difference]: Without dead ends: 1061 [2022-11-16 11:19:05,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:19:05,039 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 682 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:05,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 2052 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-16 11:19:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-11-16 11:19:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 875. [2022-11-16 11:19:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 681 states have (on average 1.2393538913362703) internal successors, (844), 689 states have internal predecessors, (844), 130 states have call successors, (130), 56 states have call predecessors, (130), 63 states have return successors, (151), 137 states have call predecessors, (151), 129 states have call successors, (151) [2022-11-16 11:19:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1125 transitions. [2022-11-16 11:19:05,230 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1125 transitions. Word has length 182 [2022-11-16 11:19:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:05,231 INFO L495 AbstractCegarLoop]: Abstraction has 875 states and 1125 transitions. [2022-11-16 11:19:05,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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-16 11:19:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1125 transitions. [2022-11-16 11:19:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-11-16 11:19:05,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:05,236 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:05,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:05,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:05,453 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash 741573795, now seen corresponding path program 1 times [2022-11-16 11:19:05,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:05,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319893804] [2022-11-16 11:19:05,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:05,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:05,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:05,456 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:05,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-16 11:19:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:06,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 11:19:06,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:06,906 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-16 11:19:06,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:19:07,922 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-16 11:19:07,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:19:07,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319893804] [2022-11-16 11:19:07,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319893804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:19:07,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:19:07,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 11:19:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118666965] [2022-11-16 11:19:07,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:19:07,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:19:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:19:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:19:07,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:19:07,926 INFO L87 Difference]: Start difference. First operand 875 states and 1125 transitions. Second operand has 16 states, 16 states have (on average 9.1875) internal successors, (147), 12 states have internal predecessors, (147), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-16 11:19:10,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:19:13,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 11:19:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:13,786 INFO L93 Difference]: Finished difference Result 1957 states and 2552 transitions. [2022-11-16 11:19:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:19:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 12 states have internal predecessors, (147), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) Word has length 197 [2022-11-16 11:19:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:13,794 INFO L225 Difference]: With dead ends: 1957 [2022-11-16 11:19:13,794 INFO L226 Difference]: Without dead ends: 1101 [2022-11-16 11:19:13,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:19:13,797 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 64 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 3713 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:13,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 3713 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-11-16 11:19:13,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2022-11-16 11:19:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 883. [2022-11-16 11:19:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 685 states have (on average 1.237956204379562) internal successors, (848), 693 states have internal predecessors, (848), 134 states have call successors, (134), 56 states have call predecessors, (134), 63 states have return successors, (159), 141 states have call predecessors, (159), 133 states have call successors, (159) [2022-11-16 11:19:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1141 transitions. [2022-11-16 11:19:14,015 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1141 transitions. Word has length 197 [2022-11-16 11:19:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:14,016 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1141 transitions. [2022-11-16 11:19:14,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 12 states have internal predecessors, (147), 4 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (25), 8 states have call predecessors, (25), 4 states have call successors, (25) [2022-11-16 11:19:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1141 transitions. [2022-11-16 11:19:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-16 11:19:14,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:14,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:14,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:14,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:14,236 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:14,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:14,236 INFO L85 PathProgramCache]: Analyzing trace with hash 828966121, now seen corresponding path program 2 times [2022-11-16 11:19:14,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:14,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288065839] [2022-11-16 11:19:14,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:19:14,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-16 11:19:14,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:14,238 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:14,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-16 11:19:16,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:19:16,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:19:16,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 1282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:19:16,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-16 11:19:17,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:19:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-11-16 11:19:17,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:19:17,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288065839] [2022-11-16 11:19:17,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288065839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:19:17,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:19:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-11-16 11:19:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971964929] [2022-11-16 11:19:17,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:19:17,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:19:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:19:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:19:17,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:19:17,846 INFO L87 Difference]: Start difference. First operand 883 states and 1141 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, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-16 11:19:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:20,747 INFO L93 Difference]: Finished difference Result 5196 states and 6743 transitions. [2022-11-16 11:19:20,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:19:20,749 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, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 203 [2022-11-16 11:19:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:20,776 INFO L225 Difference]: With dead ends: 5196 [2022-11-16 11:19:20,776 INFO L226 Difference]: Without dead ends: 5188 [2022-11-16 11:19:20,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 401 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-16 11:19:20,780 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 1139 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:20,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1670 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-16 11:19:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2022-11-16 11:19:22,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 5155. [2022-11-16 11:19:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5155 states, 4007 states have (on average 1.242575492887447) internal successors, (4979), 4063 states have internal predecessors, (4979), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 823 states have call predecessors, (939), 783 states have call successors, (939) [2022-11-16 11:19:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5155 states to 5155 states and 6702 transitions. [2022-11-16 11:19:22,129 INFO L78 Accepts]: Start accepts. Automaton has 5155 states and 6702 transitions. Word has length 203 [2022-11-16 11:19:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:22,131 INFO L495 AbstractCegarLoop]: Abstraction has 5155 states and 6702 transitions. [2022-11-16 11:19:22,131 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, (32), 3 states have call predecessors, (32), 2 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-16 11:19:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 5155 states and 6702 transitions. [2022-11-16 11:19:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-11-16 11:19:22,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:22,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:22,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:22,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:22,367 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:22,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:22,368 INFO L85 PathProgramCache]: Analyzing trace with hash -182151129, now seen corresponding path program 1 times [2022-11-16 11:19:22,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:22,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072922282] [2022-11-16 11:19:22,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:22,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:22,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:22,370 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:22,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-16 11:19:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:23,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 11:19:23,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-16 11:19:23,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:19:23,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:19:23,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072922282] [2022-11-16 11:19:23,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072922282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:19:23,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:19:23,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:19:23,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823526440] [2022-11-16 11:19:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:19:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:19:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:19:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:19:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:19:23,867 INFO L87 Difference]: Start difference. First operand 5155 states and 6702 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 11:19:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:25,868 INFO L93 Difference]: Finished difference Result 12545 states and 16683 transitions. [2022-11-16 11:19:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:19:25,870 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 203 [2022-11-16 11:19:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:25,909 INFO L225 Difference]: With dead ends: 12545 [2022-11-16 11:19:25,909 INFO L226 Difference]: Without dead ends: 7409 [2022-11-16 11:19:25,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:19:25,923 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 93 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:25,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1791 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:19:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2022-11-16 11:19:27,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 5227. [2022-11-16 11:19:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 4079 states have (on average 1.2382936994361362) internal successors, (5051), 4111 states have internal predecessors, (5051), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 847 states have call predecessors, (939), 783 states have call successors, (939) [2022-11-16 11:19:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 6774 transitions. [2022-11-16 11:19:27,291 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 6774 transitions. Word has length 203 [2022-11-16 11:19:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:27,292 INFO L495 AbstractCegarLoop]: Abstraction has 5227 states and 6774 transitions. [2022-11-16 11:19:27,293 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, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-16 11:19:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 6774 transitions. [2022-11-16 11:19:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-16 11:19:27,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:27,310 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:27,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:27,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:27,523 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:27,524 INFO L85 PathProgramCache]: Analyzing trace with hash 485150061, now seen corresponding path program 2 times [2022-11-16 11:19:27,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:27,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604537044] [2022-11-16 11:19:27,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:19:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:27,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:27,527 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:27,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-16 11:19:28,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:19:28,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:19:28,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:19:28,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-11-16 11:19:28,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:19:28,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:19:28,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604537044] [2022-11-16 11:19:28,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604537044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:19:28,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:19:28,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:19:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832481677] [2022-11-16 11:19:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:19:28,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:19:28,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:19:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:19:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:19:28,464 INFO L87 Difference]: Start difference. First operand 5227 states and 6774 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-16 11:19:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:30,694 INFO L93 Difference]: Finished difference Result 16673 states and 21758 transitions. [2022-11-16 11:19:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:19:30,695 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 209 [2022-11-16 11:19:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:30,748 INFO L225 Difference]: With dead ends: 16673 [2022-11-16 11:19:30,748 INFO L226 Difference]: Without dead ends: 11465 [2022-11-16 11:19:30,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:19:30,764 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 324 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 916 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-16 11:19:30,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 916 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:19:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2022-11-16 11:19:32,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 5251. [2022-11-16 11:19:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5251 states, 4103 states have (on average 1.236899829393127) internal successors, (5075), 4143 states have internal predecessors, (5075), 784 states have call successors, (784), 316 states have call predecessors, (784), 363 states have return successors, (939), 839 states have call predecessors, (939), 783 states have call successors, (939) [2022-11-16 11:19:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5251 states to 5251 states and 6798 transitions. [2022-11-16 11:19:32,366 INFO L78 Accepts]: Start accepts. Automaton has 5251 states and 6798 transitions. Word has length 209 [2022-11-16 11:19:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:32,367 INFO L495 AbstractCegarLoop]: Abstraction has 5251 states and 6798 transitions. [2022-11-16 11:19:32,368 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-11-16 11:19:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5251 states and 6798 transitions. [2022-11-16 11:19:32,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-11-16 11:19:32,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:32,379 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:19:32,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:32,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:32,595 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:32,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:32,596 INFO L85 PathProgramCache]: Analyzing trace with hash -826439509, now seen corresponding path program 1 times [2022-11-16 11:19:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:32,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925064310] [2022-11-16 11:19:32,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:32,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:32,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:32,599 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:32,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-16 11:19:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:33,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 1311 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:19:33,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-16 11:19:33,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:19:33,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:19:33,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925064310] [2022-11-16 11:19:33,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925064310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:19:33,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:19:33,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:19:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185265204] [2022-11-16 11:19:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:19:33,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:19:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:19:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:19:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:19:33,972 INFO L87 Difference]: Start difference. First operand 5251 states and 6798 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 11:19:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:19:35,508 INFO L93 Difference]: Finished difference Result 14057 states and 18807 transitions. [2022-11-16 11:19:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:19:35,509 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), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 216 [2022-11-16 11:19:35,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:19:35,537 INFO L225 Difference]: With dead ends: 14057 [2022-11-16 11:19:35,537 INFO L226 Difference]: Without dead ends: 8825 [2022-11-16 11:19:35,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 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-16 11:19:35,550 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 141 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:19:35,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1469 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:19:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8825 states. [2022-11-16 11:19:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8825 to 5371. [2022-11-16 11:19:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5371 states, 4199 states have (on average 1.2371993331745654) internal successors, (5195), 4215 states have internal predecessors, (5195), 808 states have call successors, (808), 316 states have call predecessors, (808), 363 states have return successors, (963), 887 states have call predecessors, (963), 807 states have call successors, (963) [2022-11-16 11:19:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5371 states to 5371 states and 6966 transitions. [2022-11-16 11:19:36,793 INFO L78 Accepts]: Start accepts. Automaton has 5371 states and 6966 transitions. Word has length 216 [2022-11-16 11:19:36,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:19:36,794 INFO L495 AbstractCegarLoop]: Abstraction has 5371 states and 6966 transitions. [2022-11-16 11:19:36,794 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), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 11:19:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5371 states and 6966 transitions. [2022-11-16 11:19:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-11-16 11:19:36,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:19:36,806 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 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] [2022-11-16 11:19:36,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:19:37,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:37,033 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:19:37,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:19:37,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2070127077, now seen corresponding path program 1 times [2022-11-16 11:19:37,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:19:37,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550977885] [2022-11-16 11:19:37,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:19:37,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:19:37,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:19:37,036 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:19:37,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-16 11:19:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:19:41,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-16 11:19:41,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:19:41,772 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-16 11:19:41,848 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-16 11:19:42,617 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-16 11:19:42,673 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2175 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.meminit_#ptr.base| v_ArrVal_2175))) is different from true [2022-11-16 11:19:42,708 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ldv_init_zalloc_#t~malloc61.base| (_ BitVec 64))) (and (exists ((v_ArrVal_2175 (Array (_ BitVec 64) (_ BitVec 8)))) (= |c_#memory_int| (store |c_old(#memory_int)| |ldv_init_zalloc_#t~malloc61.base| v_ArrVal_2175))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_init_zalloc_#t~malloc61.base|)) (exists ((v_ArrVal_2174 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_init_zalloc_#t~malloc61.base| v_ArrVal_2174) |c_#valid|)))) is different from true [2022-11-16 11:19:42,760 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-16 11:19:42,768 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-16 11:19:42,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:19:42,866 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-16 11:19:42,918 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:19:42,919 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-16 11:19:43,150 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-16 11:19:49,408 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-16 11:19:57,896 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 11:19:57,896 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-16 11:19:59,181 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-16 11:20:03,452 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-16 11:20:05,464 WARN L855 $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-16 11:20:16,513 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-16 11:20:16,513 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-16 11:20:16,961 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-16 11:20:32,148 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 11:20:32,149 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 13 treesize of output 13 [2022-11-16 11:20:34,860 WARN L855 $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-16 11:20:35,198 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-16 11:20:37,242 WARN L855 $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-16 11:20:39,614 WARN L855 $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-16 11:20:40,010 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-16 11:20:40,030 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-16 11:20:42,266 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_usb_acecad_probe_~id#1.base_BEFORE_CALL_9| (_ 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_9|))) is different from true [2022-11-16 11:20:42,537 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-16 11:20:42,558 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-16 11:20:42,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:20:42,613 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-16 11:20:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 28 proven. 18 refuted. 9 times theorem prover too weak. 17 trivial. 101 not checked. [2022-11-16 11:20:42,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:42,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2188 (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_2188) |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-16 11:20:42,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:20:42,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550977885] [2022-11-16 11:20:42,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550977885] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:42,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [335498087] [2022-11-16 11:20:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:42,974 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-16 11:20:42,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/cvc4 [2022-11-16 11:20:42,977 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-16 11:20:42,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3052d5bf-7bbb-4433-a5b9-b45fd4c08726/bin/uautomizer-tPACEb0tL8/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process