./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2bec6a520017bd7e7c0ea818bf0896201873d1ec ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2bec6a520017bd7e7c0ea818bf0896201873d1ec .................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: only flexible array member at the end can have non-constant size --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:14:47,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:14:47,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:14:47,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:14:47,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:14:47,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:14:47,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:14:47,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:14:47,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:14:47,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:14:47,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:14:47,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:14:47,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:14:47,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:14:47,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:14:47,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:14:47,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:14:47,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:14:47,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:14:47,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:14:47,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:14:47,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:14:47,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:14:47,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:14:47,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:14:47,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:14:47,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:14:47,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:14:47,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:14:47,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:14:47,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:14:47,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:14:47,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:14:47,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:14:47,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:14:47,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:14:47,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:14:47,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:14:47,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:14:47,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:14:47,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:14:47,350 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-12-07 11:14:47,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:14:47,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:14:47,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:14:47,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:14:47,364 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:14:47,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:14:47,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:14:47,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:14:47,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:14:47,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:14:47,365 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:14:47,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:14:47,366 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:14:47,366 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:14:47,366 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:14:47,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:14:47,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:14:47,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:14:47,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:14:47,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:14:47,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:14:47,368 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:14:47,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:14:47,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:14:47,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:14:47,368 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:14:47,368 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:14:47,369 INFO L138 SettingsManager]: * To the following directory=dump/ 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-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer 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(__VERIFIER_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 -> 2bec6a520017bd7e7c0ea818bf0896201873d1ec [2019-12-07 11:14:47,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:14:47,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:14:47,497 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:14:47,498 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:14:47,498 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:14:47,499 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-12-07 11:14:47,536 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/71cf4d05a/d9f0f57cef474f668beba21b01a26a03/FLAG79dd48796 [2019-12-07 11:14:48,015 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:14:48,016 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-12-07 11:14:48,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/71cf4d05a/d9f0f57cef474f668beba21b01a26a03/FLAG79dd48796 [2019-12-07 11:14:48,047 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/71cf4d05a/d9f0f57cef474f668beba21b01a26a03 [2019-12-07 11:14:48,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:14:48,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:14:48,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:14:48,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:14:48,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:14:48,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:14:48" (1/1) ... [2019-12-07 11:14:48,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a937a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:48, skipping insertion in model container [2019-12-07 11:14:48,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:14:48" (1/1) ... [2019-12-07 11:14:48,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:14:48,128 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:14:48,934 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-07 11:14:48,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:14:48,974 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:14:49,120 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-12-07 11:14:49,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:14:49,439 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:14:49,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49 WrapperNode [2019-12-07 11:14:49,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:14:49,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:14:49,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:14:49,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:14:49,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:14:49,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:14:49,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:14:49,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:14:49,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... [2019-12-07 11:14:49,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:14:49,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:14:49,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:14:49,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:14:49,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:14:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-12-07 11:14:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 11:14:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 11:14:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:14:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 11:14:49,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 11:14:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-12-07 11:14:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-12-07 11:14:49,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:14:49,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:14:50,131 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:14:50,168 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 11:14:52,759 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##511: assume false; [2019-12-07 11:14:52,759 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##512: assume !false; [2019-12-07 11:14:52,760 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2019-12-07 11:14:52,760 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2019-12-07 11:14:52,761 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:14:52,761 INFO L287 CfgBuilder]: Removed 635 assume(true) statements. [2019-12-07 11:14:52,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:14:52 BoogieIcfgContainer [2019-12-07 11:14:52,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:14:52,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:14:52,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:14:52,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:14:52,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:14:48" (1/3) ... [2019-12-07 11:14:52,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2542b0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:14:52, skipping insertion in model container [2019-12-07 11:14:52,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:14:49" (2/3) ... [2019-12-07 11:14:52,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2542b0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:14:52, skipping insertion in model container [2019-12-07 11:14:52,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:14:52" (3/3) ... [2019-12-07 11:14:52,767 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-12-07 11:14:52,773 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:14:52,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-12-07 11:14:52,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-12-07 11:14:52,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:14:52,805 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:14:52,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:14:52,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:14:52,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:14:52,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:14:52,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:14:52,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:14:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states. [2019-12-07 11:14:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:14:52,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:52,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:52,832 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1802577068, now seen corresponding path program 1 times [2019-12-07 11:14:52,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:52,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059241696] [2019-12-07 11:14:52,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:53,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059241696] [2019-12-07 11:14:53,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:53,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:14:53,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870050081] [2019-12-07 11:14:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:14:53,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:53,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:14:53,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:14:53,150 INFO L87 Difference]: Start difference. First operand 677 states. Second operand 5 states. [2019-12-07 11:14:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:53,292 INFO L93 Difference]: Finished difference Result 2018 states and 2952 transitions. [2019-12-07 11:14:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:14:53,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 11:14:53,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:53,316 INFO L225 Difference]: With dead ends: 2018 [2019-12-07 11:14:53,316 INFO L226 Difference]: Without dead ends: 1314 [2019-12-07 11:14:53,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:14:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-12-07 11:14:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 660. [2019-12-07 11:14:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-12-07 11:14:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 832 transitions. [2019-12-07 11:14:53,389 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 832 transitions. Word has length 11 [2019-12-07 11:14:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:53,389 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 832 transitions. [2019-12-07 11:14:53,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:14:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 832 transitions. [2019-12-07 11:14:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:14:53,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:53,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:53,390 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1859835370, now seen corresponding path program 1 times [2019-12-07 11:14:53,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:53,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724356899] [2019-12-07 11:14:53,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:53,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724356899] [2019-12-07 11:14:53,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:53,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:14:53,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009888472] [2019-12-07 11:14:53,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:14:53,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:53,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:14:53,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:14:53,457 INFO L87 Difference]: Start difference. First operand 660 states and 832 transitions. Second operand 3 states. [2019-12-07 11:14:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:53,576 INFO L93 Difference]: Finished difference Result 1939 states and 2453 transitions. [2019-12-07 11:14:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:14:53,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 11:14:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:53,583 INFO L225 Difference]: With dead ends: 1939 [2019-12-07 11:14:53,584 INFO L226 Difference]: Without dead ends: 1291 [2019-12-07 11:14:53,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:14:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-07 11:14:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1267. [2019-12-07 11:14:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2019-12-07 11:14:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1610 transitions. [2019-12-07 11:14:53,636 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1610 transitions. Word has length 11 [2019-12-07 11:14:53,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:53,636 INFO L462 AbstractCegarLoop]: Abstraction has 1267 states and 1610 transitions. [2019-12-07 11:14:53,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:14:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1610 transitions. [2019-12-07 11:14:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:14:53,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:53,637 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:53,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:53,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1820322560, now seen corresponding path program 1 times [2019-12-07 11:14:53,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:53,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226220830] [2019-12-07 11:14:53,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:53,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226220830] [2019-12-07 11:14:53,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:53,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:14:53,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380773794] [2019-12-07 11:14:53,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:14:53,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:53,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:14:53,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:14:53,692 INFO L87 Difference]: Start difference. First operand 1267 states and 1610 transitions. Second operand 3 states. [2019-12-07 11:14:53,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:53,719 INFO L93 Difference]: Finished difference Result 1267 states and 1610 transitions. [2019-12-07 11:14:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:14:53,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-12-07 11:14:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:53,724 INFO L225 Difference]: With dead ends: 1267 [2019-12-07 11:14:53,724 INFO L226 Difference]: Without dead ends: 1262 [2019-12-07 11:14:53,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:14:53,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2019-12-07 11:14:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1259. [2019-12-07 11:14:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1259 states. [2019-12-07 11:14:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1597 transitions. [2019-12-07 11:14:53,759 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1597 transitions. Word has length 12 [2019-12-07 11:14:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:53,760 INFO L462 AbstractCegarLoop]: Abstraction has 1259 states and 1597 transitions. [2019-12-07 11:14:53,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:14:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1597 transitions. [2019-12-07 11:14:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:14:53,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:53,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:53,761 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2005260061, now seen corresponding path program 1 times [2019-12-07 11:14:53,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:53,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208692718] [2019-12-07 11:14:53,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:53,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208692718] [2019-12-07 11:14:53,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:53,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:14:53,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324623865] [2019-12-07 11:14:53,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:14:53,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:53,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:14:53,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:14:53,830 INFO L87 Difference]: Start difference. First operand 1259 states and 1597 transitions. Second operand 3 states. [2019-12-07 11:14:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:53,928 INFO L93 Difference]: Finished difference Result 3071 states and 3938 transitions. [2019-12-07 11:14:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:14:53,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 11:14:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:53,936 INFO L225 Difference]: With dead ends: 3071 [2019-12-07 11:14:53,936 INFO L226 Difference]: Without dead ends: 1820 [2019-12-07 11:14:53,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:14:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2019-12-07 11:14:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1816. [2019-12-07 11:14:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2019-12-07 11:14:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2341 transitions. [2019-12-07 11:14:53,987 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2341 transitions. Word has length 33 [2019-12-07 11:14:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:53,987 INFO L462 AbstractCegarLoop]: Abstraction has 1816 states and 2341 transitions. [2019-12-07 11:14:53,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:14:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2341 transitions. [2019-12-07 11:14:53,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:14:53,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:53,990 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:53,990 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:53,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash -962398806, now seen corresponding path program 1 times [2019-12-07 11:14:53,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:53,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568680113] [2019-12-07 11:14:53,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:54,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568680113] [2019-12-07 11:14:54,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:54,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:14:54,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929822057] [2019-12-07 11:14:54,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:14:54,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:54,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:14:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:14:54,060 INFO L87 Difference]: Start difference. First operand 1816 states and 2341 transitions. Second operand 4 states. [2019-12-07 11:14:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:54,202 INFO L93 Difference]: Finished difference Result 3631 states and 4680 transitions. [2019-12-07 11:14:54,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:14:54,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 11:14:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:54,209 INFO L225 Difference]: With dead ends: 3631 [2019-12-07 11:14:54,209 INFO L226 Difference]: Without dead ends: 1818 [2019-12-07 11:14:54,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:14:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-12-07 11:14:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1814. [2019-12-07 11:14:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2019-12-07 11:14:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2335 transitions. [2019-12-07 11:14:54,262 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2335 transitions. Word has length 51 [2019-12-07 11:14:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:54,262 INFO L462 AbstractCegarLoop]: Abstraction has 1814 states and 2335 transitions. [2019-12-07 11:14:54,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:14:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2335 transitions. [2019-12-07 11:14:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 11:14:54,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:54,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:54,265 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:54,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1750340091, now seen corresponding path program 1 times [2019-12-07 11:14:54,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:54,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622777239] [2019-12-07 11:14:54,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:54,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:54,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622777239] [2019-12-07 11:14:54,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:54,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:14:54,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168501580] [2019-12-07 11:14:54,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:14:54,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:54,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:14:54,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:14:54,384 INFO L87 Difference]: Start difference. First operand 1814 states and 2335 transitions. Second operand 5 states. [2019-12-07 11:14:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:14:59,731 INFO L93 Difference]: Finished difference Result 3538 states and 4563 transitions. [2019-12-07 11:14:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:14:59,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-07 11:14:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:14:59,745 INFO L225 Difference]: With dead ends: 3538 [2019-12-07 11:14:59,745 INFO L226 Difference]: Without dead ends: 3476 [2019-12-07 11:14:59,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:14:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2019-12-07 11:14:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 1814. [2019-12-07 11:14:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2019-12-07 11:14:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2333 transitions. [2019-12-07 11:14:59,805 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2333 transitions. Word has length 68 [2019-12-07 11:14:59,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:14:59,806 INFO L462 AbstractCegarLoop]: Abstraction has 1814 states and 2333 transitions. [2019-12-07 11:14:59,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:14:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2333 transitions. [2019-12-07 11:14:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 11:14:59,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:14:59,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:14:59,808 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:14:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:14:59,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1559673976, now seen corresponding path program 1 times [2019-12-07 11:14:59,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:14:59,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521096550] [2019-12-07 11:14:59,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:14:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:14:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:14:59,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521096550] [2019-12-07 11:14:59,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:14:59,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:14:59,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975165092] [2019-12-07 11:14:59,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:14:59,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:14:59,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:14:59,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:14:59,964 INFO L87 Difference]: Start difference. First operand 1814 states and 2333 transitions. Second operand 5 states. [2019-12-07 11:15:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:02,261 INFO L93 Difference]: Finished difference Result 3988 states and 5130 transitions. [2019-12-07 11:15:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:15:02,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-07 11:15:02,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:02,269 INFO L225 Difference]: With dead ends: 3988 [2019-12-07 11:15:02,269 INFO L226 Difference]: Without dead ends: 2145 [2019-12-07 11:15:02,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:15:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-12-07 11:15:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1218. [2019-12-07 11:15:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-12-07 11:15:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1574 transitions. [2019-12-07 11:15:02,312 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1574 transitions. Word has length 69 [2019-12-07 11:15:02,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:02,312 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1574 transitions. [2019-12-07 11:15:02,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1574 transitions. [2019-12-07 11:15:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 11:15:02,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:02,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:02,313 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:02,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1419125366, now seen corresponding path program 1 times [2019-12-07 11:15:02,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:02,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782409381] [2019-12-07 11:15:02,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:02,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782409381] [2019-12-07 11:15:02,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:02,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:02,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566154379] [2019-12-07 11:15:02,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:15:02,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:02,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:15:02,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:15:02,500 INFO L87 Difference]: Start difference. First operand 1218 states and 1574 transitions. Second operand 4 states. [2019-12-07 11:15:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:02,708 INFO L93 Difference]: Finished difference Result 2150 states and 2769 transitions. [2019-12-07 11:15:02,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:15:02,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 11:15:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:02,716 INFO L225 Difference]: With dead ends: 2150 [2019-12-07 11:15:02,716 INFO L226 Difference]: Without dead ends: 2126 [2019-12-07 11:15:02,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:15:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2019-12-07 11:15:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2097. [2019-12-07 11:15:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2097 states. [2019-12-07 11:15:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 2717 transitions. [2019-12-07 11:15:02,787 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 2717 transitions. Word has length 69 [2019-12-07 11:15:02,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:02,788 INFO L462 AbstractCegarLoop]: Abstraction has 2097 states and 2717 transitions. [2019-12-07 11:15:02,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:15:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 2717 transitions. [2019-12-07 11:15:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:15:02,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:02,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:02,789 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1577877889, now seen corresponding path program 1 times [2019-12-07 11:15:02,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:02,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788444218] [2019-12-07 11:15:02,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:02,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788444218] [2019-12-07 11:15:02,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:02,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:02,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215133145] [2019-12-07 11:15:02,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:02,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:02,933 INFO L87 Difference]: Start difference. First operand 2097 states and 2717 transitions. Second operand 5 states. [2019-12-07 11:15:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:07,369 INFO L93 Difference]: Finished difference Result 7387 states and 9593 transitions. [2019-12-07 11:15:07,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:15:07,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-07 11:15:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:07,393 INFO L225 Difference]: With dead ends: 7387 [2019-12-07 11:15:07,393 INFO L226 Difference]: Without dead ends: 7318 [2019-12-07 11:15:07,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:15:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7318 states. [2019-12-07 11:15:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7318 to 2132. [2019-12-07 11:15:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-12-07 11:15:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2759 transitions. [2019-12-07 11:15:07,482 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2759 transitions. Word has length 75 [2019-12-07 11:15:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:07,482 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2759 transitions. [2019-12-07 11:15:07,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2759 transitions. [2019-12-07 11:15:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 11:15:07,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:07,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:07,484 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1515838275, now seen corresponding path program 1 times [2019-12-07 11:15:07,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:07,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183854837] [2019-12-07 11:15:07,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:07,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183854837] [2019-12-07 11:15:07,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:07,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:15:07,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825117566] [2019-12-07 11:15:07,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:15:07,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:07,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:15:07,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:15:07,629 INFO L87 Difference]: Start difference. First operand 2132 states and 2759 transitions. Second operand 9 states. [2019-12-07 11:15:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:14,577 INFO L93 Difference]: Finished difference Result 3922 states and 5064 transitions. [2019-12-07 11:15:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:15:14,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-12-07 11:15:14,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:14,589 INFO L225 Difference]: With dead ends: 3922 [2019-12-07 11:15:14,590 INFO L226 Difference]: Without dead ends: 3867 [2019-12-07 11:15:14,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:15:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2019-12-07 11:15:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 2132. [2019-12-07 11:15:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-12-07 11:15:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 2758 transitions. [2019-12-07 11:15:14,679 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 2758 transitions. Word has length 75 [2019-12-07 11:15:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:14,679 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 2758 transitions. [2019-12-07 11:15:14,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:15:14,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 2758 transitions. [2019-12-07 11:15:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 11:15:14,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:14,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:14,680 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:14,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:14,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1909895391, now seen corresponding path program 1 times [2019-12-07 11:15:14,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:14,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176847682] [2019-12-07 11:15:14,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:14,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:14,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176847682] [2019-12-07 11:15:14,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:14,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:15:14,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681177658] [2019-12-07 11:15:14,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:14,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:14,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:14,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:14,793 INFO L87 Difference]: Start difference. First operand 2132 states and 2758 transitions. Second operand 5 states. [2019-12-07 11:15:15,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:15,302 INFO L93 Difference]: Finished difference Result 4315 states and 5580 transitions. [2019-12-07 11:15:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:15:15,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-07 11:15:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:15,308 INFO L225 Difference]: With dead ends: 4315 [2019-12-07 11:15:15,308 INFO L226 Difference]: Without dead ends: 4286 [2019-12-07 11:15:15,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2019-12-07 11:15:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 2720. [2019-12-07 11:15:15,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2019-12-07 11:15:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3507 transitions. [2019-12-07 11:15:15,447 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 3507 transitions. Word has length 76 [2019-12-07 11:15:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:15,447 INFO L462 AbstractCegarLoop]: Abstraction has 2720 states and 3507 transitions. [2019-12-07 11:15:15,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 3507 transitions. [2019-12-07 11:15:15,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 11:15:15,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:15,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:15,448 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:15,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2137826484, now seen corresponding path program 1 times [2019-12-07 11:15:15,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:15,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742843505] [2019-12-07 11:15:15,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:15,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742843505] [2019-12-07 11:15:15,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:15,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:15,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951710810] [2019-12-07 11:15:15,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:15,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:15,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:15,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:15,535 INFO L87 Difference]: Start difference. First operand 2720 states and 3507 transitions. Second operand 5 states. [2019-12-07 11:15:20,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:20,598 INFO L93 Difference]: Finished difference Result 4507 states and 5812 transitions. [2019-12-07 11:15:20,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:15:20,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-07 11:15:20,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:20,604 INFO L225 Difference]: With dead ends: 4507 [2019-12-07 11:15:20,604 INFO L226 Difference]: Without dead ends: 4446 [2019-12-07 11:15:20,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:15:20,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-07 11:15:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2731. [2019-12-07 11:15:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2019-12-07 11:15:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 3519 transitions. [2019-12-07 11:15:20,757 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 3519 transitions. Word has length 82 [2019-12-07 11:15:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:20,757 INFO L462 AbstractCegarLoop]: Abstraction has 2731 states and 3519 transitions. [2019-12-07 11:15:20,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 3519 transitions. [2019-12-07 11:15:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 11:15:20,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:20,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:20,758 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:20,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:20,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1845332201, now seen corresponding path program 1 times [2019-12-07 11:15:20,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:20,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861451697] [2019-12-07 11:15:20,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:20,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861451697] [2019-12-07 11:15:20,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:20,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:20,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210974739] [2019-12-07 11:15:20,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:20,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:20,860 INFO L87 Difference]: Start difference. First operand 2731 states and 3519 transitions. Second operand 5 states. [2019-12-07 11:15:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:23,493 INFO L93 Difference]: Finished difference Result 6557 states and 8429 transitions. [2019-12-07 11:15:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:15:23,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-07 11:15:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:23,498 INFO L225 Difference]: With dead ends: 6557 [2019-12-07 11:15:23,498 INFO L226 Difference]: Without dead ends: 4120 [2019-12-07 11:15:23,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:15:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-12-07 11:15:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 2206. [2019-12-07 11:15:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-12-07 11:15:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 2842 transitions. [2019-12-07 11:15:23,603 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 2842 transitions. Word has length 83 [2019-12-07 11:15:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:23,603 INFO L462 AbstractCegarLoop]: Abstraction has 2206 states and 2842 transitions. [2019-12-07 11:15:23,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 2842 transitions. [2019-12-07 11:15:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 11:15:23,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:23,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:23,604 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:23,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:23,604 INFO L82 PathProgramCache]: Analyzing trace with hash -459128807, now seen corresponding path program 1 times [2019-12-07 11:15:23,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:23,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796723301] [2019-12-07 11:15:23,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:23,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796723301] [2019-12-07 11:15:23,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:23,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:23,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743741238] [2019-12-07 11:15:23,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:15:23,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:15:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:15:23,705 INFO L87 Difference]: Start difference. First operand 2206 states and 2842 transitions. Second operand 6 states. [2019-12-07 11:15:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:24,217 INFO L93 Difference]: Finished difference Result 5162 states and 6659 transitions. [2019-12-07 11:15:24,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:15:24,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-07 11:15:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:24,223 INFO L225 Difference]: With dead ends: 5162 [2019-12-07 11:15:24,223 INFO L226 Difference]: Without dead ends: 5085 [2019-12-07 11:15:24,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:15:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2019-12-07 11:15:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 2770. [2019-12-07 11:15:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2019-12-07 11:15:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3562 transitions. [2019-12-07 11:15:24,361 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3562 transitions. Word has length 83 [2019-12-07 11:15:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:24,361 INFO L462 AbstractCegarLoop]: Abstraction has 2770 states and 3562 transitions. [2019-12-07 11:15:24,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:15:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3562 transitions. [2019-12-07 11:15:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 11:15:24,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:24,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:24,362 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:24,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 608597908, now seen corresponding path program 1 times [2019-12-07 11:15:24,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:24,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773330889] [2019-12-07 11:15:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:24,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773330889] [2019-12-07 11:15:24,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:24,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:15:24,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416508205] [2019-12-07 11:15:24,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:15:24,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:24,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:15:24,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:15:24,503 INFO L87 Difference]: Start difference. First operand 2770 states and 3562 transitions. Second operand 8 states. [2019-12-07 11:15:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:28,545 INFO L93 Difference]: Finished difference Result 4553 states and 5857 transitions. [2019-12-07 11:15:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:15:28,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-07 11:15:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:28,549 INFO L225 Difference]: With dead ends: 4553 [2019-12-07 11:15:28,549 INFO L226 Difference]: Without dead ends: 4499 [2019-12-07 11:15:28,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:15:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4499 states. [2019-12-07 11:15:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4499 to 2764. [2019-12-07 11:15:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2764 states. [2019-12-07 11:15:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3552 transitions. [2019-12-07 11:15:28,690 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3552 transitions. Word has length 88 [2019-12-07 11:15:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:28,690 INFO L462 AbstractCegarLoop]: Abstraction has 2764 states and 3552 transitions. [2019-12-07 11:15:28,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:15:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3552 transitions. [2019-12-07 11:15:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 11:15:28,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:28,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:28,692 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1241466638, now seen corresponding path program 1 times [2019-12-07 11:15:28,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:28,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464837857] [2019-12-07 11:15:28,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:28,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464837857] [2019-12-07 11:15:28,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:28,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:28,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198207892] [2019-12-07 11:15:28,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:28,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:28,785 INFO L87 Difference]: Start difference. First operand 2764 states and 3552 transitions. Second operand 5 states. [2019-12-07 11:15:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:33,277 INFO L93 Difference]: Finished difference Result 4501 states and 5796 transitions. [2019-12-07 11:15:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:15:33,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-12-07 11:15:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:33,281 INFO L225 Difference]: With dead ends: 4501 [2019-12-07 11:15:33,281 INFO L226 Difference]: Without dead ends: 4453 [2019-12-07 11:15:33,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:15:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2019-12-07 11:15:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 2710. [2019-12-07 11:15:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-12-07 11:15:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3489 transitions. [2019-12-07 11:15:33,424 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3489 transitions. Word has length 89 [2019-12-07 11:15:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:33,424 INFO L462 AbstractCegarLoop]: Abstraction has 2710 states and 3489 transitions. [2019-12-07 11:15:33,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3489 transitions. [2019-12-07 11:15:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 11:15:33,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:33,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:33,426 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:33,426 INFO L82 PathProgramCache]: Analyzing trace with hash -242421533, now seen corresponding path program 1 times [2019-12-07 11:15:33,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:33,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660901141] [2019-12-07 11:15:33,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:33,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660901141] [2019-12-07 11:15:33,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:33,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:15:33,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490607337] [2019-12-07 11:15:33,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:15:33,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:33,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:15:33,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:15:33,527 INFO L87 Difference]: Start difference. First operand 2710 states and 3489 transitions. Second operand 4 states. [2019-12-07 11:15:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:33,701 INFO L93 Difference]: Finished difference Result 2718 states and 3495 transitions. [2019-12-07 11:15:33,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:15:33,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 11:15:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:33,704 INFO L225 Difference]: With dead ends: 2718 [2019-12-07 11:15:33,704 INFO L226 Difference]: Without dead ends: 2714 [2019-12-07 11:15:33,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2019-12-07 11:15:33,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2710. [2019-12-07 11:15:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2710 states. [2019-12-07 11:15:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3486 transitions. [2019-12-07 11:15:33,885 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3486 transitions. Word has length 116 [2019-12-07 11:15:33,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:33,885 INFO L462 AbstractCegarLoop]: Abstraction has 2710 states and 3486 transitions. [2019-12-07 11:15:33,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:15:33,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3486 transitions. [2019-12-07 11:15:33,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 11:15:33,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:33,887 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:15:33,887 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:33,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1543411078, now seen corresponding path program 1 times [2019-12-07 11:15:33,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:33,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682937979] [2019-12-07 11:15:33,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:34,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682937979] [2019-12-07 11:15:34,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:34,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:34,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434621754] [2019-12-07 11:15:34,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:34,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:34,005 INFO L87 Difference]: Start difference. First operand 2710 states and 3486 transitions. Second operand 5 states. [2019-12-07 11:15:36,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:36,316 INFO L93 Difference]: Finished difference Result 6402 states and 8222 transitions. [2019-12-07 11:15:36,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:15:36,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-12-07 11:15:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:36,319 INFO L225 Difference]: With dead ends: 6402 [2019-12-07 11:15:36,319 INFO L226 Difference]: Without dead ends: 3991 [2019-12-07 11:15:36,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:15:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3991 states. [2019-12-07 11:15:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3991 to 2144. [2019-12-07 11:15:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2144 states. [2019-12-07 11:15:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2760 transitions. [2019-12-07 11:15:36,447 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2760 transitions. Word has length 121 [2019-12-07 11:15:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:36,447 INFO L462 AbstractCegarLoop]: Abstraction has 2144 states and 2760 transitions. [2019-12-07 11:15:36,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2760 transitions. [2019-12-07 11:15:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 11:15:36,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:36,448 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:15:36,449 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1466510280, now seen corresponding path program 1 times [2019-12-07 11:15:36,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:36,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794317493] [2019-12-07 11:15:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:36,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794317493] [2019-12-07 11:15:36,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:36,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:36,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216827292] [2019-12-07 11:15:36,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:36,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:36,543 INFO L87 Difference]: Start difference. First operand 2144 states and 2760 transitions. Second operand 3 states. [2019-12-07 11:15:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:36,755 INFO L93 Difference]: Finished difference Result 4051 states and 5201 transitions. [2019-12-07 11:15:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:36,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 11:15:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:36,757 INFO L225 Difference]: With dead ends: 4051 [2019-12-07 11:15:36,757 INFO L226 Difference]: Without dead ends: 2199 [2019-12-07 11:15:36,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-12-07 11:15:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2114. [2019-12-07 11:15:36,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-07 11:15:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2700 transitions. [2019-12-07 11:15:36,875 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2700 transitions. Word has length 121 [2019-12-07 11:15:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:36,876 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 2700 transitions. [2019-12-07 11:15:36,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2700 transitions. [2019-12-07 11:15:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 11:15:36,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:36,877 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:15:36,877 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:36,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash 945206072, now seen corresponding path program 1 times [2019-12-07 11:15:36,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:36,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132395360] [2019-12-07 11:15:36,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:36,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132395360] [2019-12-07 11:15:36,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:36,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:36,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082662408] [2019-12-07 11:15:36,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:36,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:36,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:36,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:36,956 INFO L87 Difference]: Start difference. First operand 2114 states and 2700 transitions. Second operand 3 states. [2019-12-07 11:15:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:37,124 INFO L93 Difference]: Finished difference Result 3954 states and 5037 transitions. [2019-12-07 11:15:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:37,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 11:15:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:37,126 INFO L225 Difference]: With dead ends: 3954 [2019-12-07 11:15:37,126 INFO L226 Difference]: Without dead ends: 2132 [2019-12-07 11:15:37,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-12-07 11:15:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2108. [2019-12-07 11:15:37,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2108 states. [2019-12-07 11:15:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2688 transitions. [2019-12-07 11:15:37,243 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2688 transitions. Word has length 121 [2019-12-07 11:15:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:37,244 INFO L462 AbstractCegarLoop]: Abstraction has 2108 states and 2688 transitions. [2019-12-07 11:15:37,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2688 transitions. [2019-12-07 11:15:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 11:15:37,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:37,245 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:15:37,245 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1282978488, now seen corresponding path program 1 times [2019-12-07 11:15:37,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:37,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129069250] [2019-12-07 11:15:37,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:37,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129069250] [2019-12-07 11:15:37,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624821381] [2019-12-07 11:15:37,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:37,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:15:37,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:15:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:37,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:15:37,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-12-07 11:15:37,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088718273] [2019-12-07 11:15:37,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:15:37,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:37,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:15:37,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:37,708 INFO L87 Difference]: Start difference. First operand 2108 states and 2688 transitions. Second operand 4 states. [2019-12-07 11:15:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:37,946 INFO L93 Difference]: Finished difference Result 3928 states and 4994 transitions. [2019-12-07 11:15:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:15:37,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 11:15:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:37,952 INFO L225 Difference]: With dead ends: 3928 [2019-12-07 11:15:37,952 INFO L226 Difference]: Without dead ends: 2112 [2019-12-07 11:15:37,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:37,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2019-12-07 11:15:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2108. [2019-12-07 11:15:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2108 states. [2019-12-07 11:15:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 2684 transitions. [2019-12-07 11:15:38,095 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 2684 transitions. Word has length 121 [2019-12-07 11:15:38,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:38,096 INFO L462 AbstractCegarLoop]: Abstraction has 2108 states and 2684 transitions. [2019-12-07 11:15:38,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:15:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 2684 transitions. [2019-12-07 11:15:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 11:15:38,097 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:38,097 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:15:38,298 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:15:38,298 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:38,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash -990080946, now seen corresponding path program 1 times [2019-12-07 11:15:38,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:38,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044597303] [2019-12-07 11:15:38,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:38,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044597303] [2019-12-07 11:15:38,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:38,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:15:38,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792101453] [2019-12-07 11:15:38,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:15:38,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:15:38,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:15:38,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:15:38,431 INFO L87 Difference]: Start difference. First operand 2108 states and 2684 transitions. Second operand 5 states. [2019-12-07 11:15:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:39,906 INFO L93 Difference]: Finished difference Result 3981 states and 5045 transitions. [2019-12-07 11:15:39,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:15:39,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-12-07 11:15:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:39,908 INFO L225 Difference]: With dead ends: 3981 [2019-12-07 11:15:39,909 INFO L226 Difference]: Without dead ends: 2160 [2019-12-07 11:15:39,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:15:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-12-07 11:15:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2113. [2019-12-07 11:15:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2019-12-07 11:15:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2690 transitions. [2019-12-07 11:15:40,033 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2690 transitions. Word has length 129 [2019-12-07 11:15:40,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:40,033 INFO L462 AbstractCegarLoop]: Abstraction has 2113 states and 2690 transitions. [2019-12-07 11:15:40,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:15:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2690 transitions. [2019-12-07 11:15:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 11:15:40,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:40,035 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:15:40,035 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 918376844, now seen corresponding path program 1 times [2019-12-07 11:15:40,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:15:40,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852186948] [2019-12-07 11:15:40,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:15:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:15:41,176 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:15:41,176 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:15:41,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:15:41 BoogieIcfgContainer [2019-12-07 11:15:41,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:15:41,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:15:41,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:15:41,471 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:15:41,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:14:52" (3/4) ... [2019-12-07 11:15:41,474 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:15:41,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:15:41,476 INFO L168 Benchmark]: Toolchain (without parser) took 53425.80 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 742.4 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -85.6 MB). Peak memory consumption was 656.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:41,476 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:41,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1390.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:41,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:41,477 INFO L168 Benchmark]: Boogie Preprocessor took 152.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:41,477 INFO L168 Benchmark]: RCFGBuilder took 3004.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.6 MB). Peak memory consumption was 252.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:41,477 INFO L168 Benchmark]: TraceAbstraction took 48708.30 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 505.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.0 MB). Peak memory consumption was 620.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:41,477 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:41,479 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1390.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 222.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 164.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 152.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3004.28 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -67.6 MB). Peak memory consumption was 252.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48708.30 ms. Allocated memory was 1.3 GB in the beginning and 1.8 GB in the end (delta: 505.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 115.0 MB). Peak memory consumption was 620.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 ms. Allocated memory is still 1.8 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6935]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 6624, overapproximation of bitwiseOr at line 5685, overapproximation of shiftLeft at line 5130, overapproximation of bitwiseAnd at line 4917. Possible FailurePath: [L5159-L5170] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5171-L5186] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5187-L5191] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5192-L5193] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6118-L6165] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6220-L6258] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6259] static struct lock_class_key __key___9 ; [L6260] static struct lock_class_key __key___10 ; [L6261] static struct lock_class_key __key___11 ; [L6673-L6681] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6684-L6699] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6752] int LDV_IN_INTERRUPT ; [L6753] static int res_catc_open_15 ; [L6754] static int res_catc_stop_16 ; [L6755] static int res_catc_probe_17 ; [L6948] int ldv_urb_state = 0; [L6949] int ldv_coherent_state = 0; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6757] struct net_device *var_group1 ; [L6758] struct ethtool_drvinfo *var_group2 ; [L6759] struct ethtool_cmd *var_group3 ; [L6760] struct sk_buff *var_group4 ; [L6761] struct usb_interface *var_group5 ; [L6762] struct usb_device_id const *var_catc_probe_17_p1 ; [L6763] unsigned long var_catc_stats_timer_10_p0 ; [L6764] int tmp___7 ; [L6765] int ldv_s_catc_netdev_ops_net_device_ops ; [L6766] int ldv_s_catc_driver_usb_driver ; [L6767] int tmp___8 ; [L6768] int tmp___9 ; [L6771] LDV_IN_INTERRUPT = 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6703] int result ; [L6704] int tmp___7 ; [L5077] int tmp___7 ; [L7191] return __VERIFIER_nondet_int(); [L5080] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5082] return (tmp___7); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6707] tmp___7 = usb_register(& catc_driver) [L6708] result = tmp___7 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6710] COND TRUE result == 0 [L6716] return (result); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6773] tmp___7 = catc_init() [L6775] COND FALSE !(\read(tmp___7)) [L6779] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6780] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6785] tmp___9 = __VERIFIER_nondet_int() [L6787] COND TRUE \read(tmp___9) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___8 = __VERIFIER_nondet_int() [L6798] COND FALSE !(tmp___8 == 0) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6801] COND FALSE !(tmp___8 == 1) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6804] COND FALSE !(tmp___8 == 2) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] COND FALSE !(tmp___8 == 3) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6810] COND FALSE !(tmp___8 == 4) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6813] COND FALSE !(tmp___8 == 5) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6816] COND FALSE !(tmp___8 == 6) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6819] COND TRUE tmp___8 == 7 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6884] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6263] struct usb_device *usbdev ; [L6264] struct usb_device *tmp___7 ; [L6265] struct net_device *netdev ; [L6266] struct catc *catc ; [L6267] u8 broadcast[6] ; [L6268] int i ; [L6269] int pktsz ; [L6270] int tmp___8 ; [L6271] void *tmp___9 ; [L6272] unsigned int tmp___10 ; [L6273] unsigned int tmp___11 ; [L6274] unsigned int tmp___12 ; [L6275] unsigned int tmp___13 ; [L6276] char const *tmp___14 ; [L6277] int tmp___15 ; [L5054] struct device const *__mptr ; [L5056] EXPR intf->dev.parent [L5056] __mptr = (struct device const *)intf->dev.parent [L5057] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6280] tmp___7 = interface_to_usbdev(intf) [L6281] usbdev = tmp___7 [L6282] EXPR intf->altsetting [L6282] EXPR (intf->altsetting)->desc.bInterfaceNumber [L7195] return __VERIFIER_nondet_int(); [L6282-L6283] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6285] COND FALSE !(\read(tmp___8)) [L7099] return ldv_malloc(sizeof(struct net_device)); [L6293] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6295] COND FALSE !(! netdev) [L4917] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6300] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6301] catc = (struct catc *)tmp___9 [L6302] netdev->netdev_ops = & catc_netdev_ops [L6303] netdev->watchdog_timeo = 1250 [L6304] netdev->ethtool_ops = & ops [L6305] catc->usbdev = usbdev [L6306] catc->netdev = netdev VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6309] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6315] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6332] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4840] return (& lock->__annonCompField18.rlock); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6338] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6355] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6366] catc->timer.data = (unsigned long )((long )catc) [L6367] catc->timer.function = & catc_stats_timer [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7143] return ldv_malloc(0UL); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6368] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7143] return ldv_malloc(0UL); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6369] catc->tx_urb = usb_alloc_urb(0, 208U) [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7143] return ldv_malloc(0UL); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6370] catc->rx_urb = usb_alloc_urb(0, 208U) [L7011] void *arbitrary_memory ; [L7012] void *tmp___7 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7015] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7143] return ldv_malloc(0UL); [L7018] tmp___7 = ldv_undefined_pointer() [L7019] arbitrary_memory = tmp___7 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7021] COND FALSE !(! arbitrary_memory) [L7025] ldv_urb_state = ldv_urb_state + 1 [L7026] return ((struct urb *)arbitrary_memory); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6371] catc->irq_urb = usb_alloc_urb(0, 208U) [L6373] EXPR catc->ctrl_urb VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6373] COND FALSE !(! catc->ctrl_urb) [L6376] EXPR catc->tx_urb VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6376] COND FALSE !(! catc->tx_urb) [L6379] EXPR catc->rx_urb VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6379] COND FALSE !(! catc->rx_urb) [L6382] EXPR catc->irq_urb VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6382] COND FALSE !(! catc->irq_urb) [L6395] EXPR usbdev->descriptor.idVendor VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6395] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6418] pktsz = 23070 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6421] tmp___10 = __create_pipe(usbdev, 0U) [L6422] catc->ctrl_urb [L5092] urb->dev = dev [L5093] urb->pipe = pipe [L5094] urb->setup_packet = setup_packet [L5095] urb->transfer_buffer = transfer_buffer [L5096] urb->transfer_buffer_length = (u32 )buffer_length [L5097] urb->complete = complete_fn [L5098] urb->context = context VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6425] tmp___11 = __create_pipe(usbdev, 1U) [L6426] catc->tx_urb [L5108] urb->dev = dev [L5109] urb->pipe = pipe [L5110] urb->transfer_buffer = transfer_buffer [L5111] urb->transfer_buffer_length = (u32 )buffer_length [L5112] urb->complete = complete_fn [L5113] urb->context = context VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6428] tmp___12 = __create_pipe(usbdev, 1U) [L6429] catc->rx_urb [L5108] urb->dev = dev [L5109] urb->pipe = pipe [L5110] urb->transfer_buffer = transfer_buffer [L5111] urb->transfer_buffer_length = (u32 )buffer_length [L5112] urb->complete = complete_fn [L5113] urb->context = context VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6431] tmp___13 = __create_pipe(usbdev, 2U) [L6432] catc->irq_urb [L5123] urb->dev = dev [L5124] urb->pipe = pipe [L5125] urb->transfer_buffer = transfer_buffer [L5126] urb->transfer_buffer_length = (u32 )buffer_length [L5127] urb->complete = complete_fn [L5128] urb->context = context [L5129] EXPR dev->speed VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5129] COND TRUE (unsigned int )dev->speed == 3U [L5130] urb->interval = 1 << (interval - 1) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5137] urb->start_frame = -1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6435] EXPR catc->is_f5u011 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6435] COND FALSE !(! catc->is_f5u011) [L6588] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5666] int retval ; [L5667] unsigned int tmp___7 ; [L5668] unsigned int tmp___8 ; [L5669] unsigned int tmp___9 ; [L5670] int tmp___10 ; [L5671] int tmp___11 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5673] COND FALSE !(\read(dir)) [L5680] EXPR catc->usbdev [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5680] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5681] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5685] EXPR catc->usbdev [L7181] return __VERIFIER_nondet_int(); [L5685-L5686] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5687] retval = tmp___10 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5689] COND TRUE retval < 0 [L5690] tmp___11 = retval VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6597] netdev->dev_addr [L5666] int retval ; [L5667] unsigned int tmp___7 ; [L5668] unsigned int tmp___8 ; [L5669] unsigned int tmp___9 ; [L5670] int tmp___10 ; [L5671] int tmp___11 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5673] COND TRUE \read(dir) [L5675] EXPR catc->usbdev [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5675] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5676] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5685] EXPR catc->usbdev [L7181] return __VERIFIER_nondet_int(); [L5685-L5686] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5687] retval = tmp___10 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5689] COND TRUE retval < 0 [L5690] tmp___11 = retval VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6601] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6609] catc->rxmode[0] = (u8 )11 [L6610] catc->rxmode[1] = (u8 )0 [L5666] int retval ; [L5667] unsigned int tmp___7 ; [L5668] unsigned int tmp___8 ; [L5669] unsigned int tmp___9 ; [L5670] int tmp___10 ; [L5671] int tmp___11 ; VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5673] COND FALSE !(\read(dir)) [L5680] EXPR catc->usbdev [L5156] EXPR dev->devnum [L5156] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5680] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5681] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5685] EXPR catc->usbdev [L7181] return __VERIFIER_nondet_int(); [L5685-L5686] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5687] retval = tmp___10 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5689] COND FALSE !(retval < 0) [L5692] tmp___11 = 0 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5694] return (tmp___11); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6616] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6623] catc->is_f5u011 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6623] COND TRUE catc->is_f5u011 [L6624] tmp___14 = "Belkin F5U011" VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6629] EXPR usbdev->bus [L6629] (usbdev->bus)->bus_name [L6630] netdev->dev_addr [L7120] return __VERIFIER_nondet_int(); [L6632] netdev->dev.parent = & intf->dev [L7169] return __VERIFIER_nondet_int(); [L6633] tmp___15 = register_netdev(netdev) [L6635] COND FALSE !(tmp___15 != 0) [L6647] return (0); [L6647] return (0); [L6647] return (0); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6886] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6889] COND FALSE !(\read(res_catc_probe_17)) [L6893] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6782] COND TRUE 1 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6785] tmp___9 = __VERIFIER_nondet_int() [L6787] COND TRUE \read(tmp___9) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___8 = __VERIFIER_nondet_int() [L6798] COND FALSE !(tmp___8 == 0) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6801] COND FALSE !(tmp___8 == 1) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6804] COND TRUE tmp___8 == 2 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6841] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6167] struct catc *catc ; [L6168] void *tmp___7 ; [L6169] int status ; [L4917] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6172] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6173] catc = (struct catc *)tmp___7 [L6174] EXPR catc->irq_urb [L6174] EXPR catc->usbdev [L6174] (catc->irq_urb)->dev = catc->usbdev [L6175] EXPR catc->irq_urb [L7199] return __VERIFIER_nondet_int(); [L6175] status = usb_submit_urb(catc->irq_urb, 208U) [L6177] COND TRUE status < 0 [L6181] return (-1); VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6843] res_catc_open_15 = catc_open(var_group1) [L6846] COND TRUE res_catc_open_15 < 0 VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7070] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6935] __VERIFIER_error() VAL [__key___10={357:0}, __key___11={314:0}, __key___9={330:0}, __this_module={4294967310:4294967364}, catc_driver={287:0}, catc_id_table={353:0}, catc_netdev_ops={325:0}, driver_name={358:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={359:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 677 locations, 14 error locations. Result: UNSAFE, OverallTime: 48.3s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 41.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 28009 SDtfs, 27582 SDslu, 49629 SDs, 0 SdLazy, 7177 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 184 SyntacticMatches, 13 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2770occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 23227 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1954 NumberOfCodeBlocks, 1954 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1802 ConstructedInterpolants, 0 QuantifiedInterpolants, 445400 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2134 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 31/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:15:42,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:15:42,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:15:42,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:15:42,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:15:42,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:15:42,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:15:42,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:15:42,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:15:42,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:15:42,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:15:42,845 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:15:42,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:15:42,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:15:42,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:15:42,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:15:42,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:15:42,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:15:42,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:15:42,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:15:42,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:15:42,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:15:42,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:15:42,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:15:42,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:15:42,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:15:42,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:15:42,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:15:42,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:15:42,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:15:42,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:15:42,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:15:42,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:15:42,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:15:42,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:15:42,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:15:42,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:15:42,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:15:42,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:15:42,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:15:42,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:15:42,863 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-12-07 11:15:42,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:15:42,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:15:42,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:15:42,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:15:42,874 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:15:42,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:15:42,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:15:42,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:15:42,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:15:42,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:15:42,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:15:42,876 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:15:42,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:15:42,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:15:42,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:15:42,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-07 11:15:42,877 INFO L138 SettingsManager]: * To the following directory=dump/ 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-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer 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(__VERIFIER_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 -> 2bec6a520017bd7e7c0ea818bf0896201873d1ec [2019-12-07 11:15:43,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:15:43,046 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:15:43,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:15:43,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:15:43,049 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:15:43,050 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-12-07 11:15:43,088 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/ca3f77496/2e53fae5ea644ecdb45607dda5e00ca4/FLAGdd66d6e74 [2019-12-07 11:15:43,688 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:15:43,689 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2019-12-07 11:15:43,709 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/ca3f77496/2e53fae5ea644ecdb45607dda5e00ca4/FLAGdd66d6e74 [2019-12-07 11:15:44,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_961ddbad-dc3a-46f3-9137-36a85bbaece4/bin/uautomizer/data/ca3f77496/2e53fae5ea644ecdb45607dda5e00ca4 [2019-12-07 11:15:44,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:15:44,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:15:44,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:44,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:15:44,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:15:44,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:44" (1/1) ... [2019-12-07 11:15:44,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e377be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:44, skipping insertion in model container [2019-12-07 11:15:44,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:44" (1/1) ... [2019-12-07 11:15:44,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:15:44,190 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:15:44,709 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError: only flexible array member at the end can have non-constant size at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeMemberOffset(TypeSizeAndOffsetComputer.java:583) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:304) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:203) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructOffsetForField(TypeSizeAndOffsetComputer.java:133) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructOffsetForField(TypeSizeAndOffsetComputer.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.StructHandler.handleFieldReference(StructHandler.java:139) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:270) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:174) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:641) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:698) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1336) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1029) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1029) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1029) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3458) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:571) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:15:44,713 INFO L168 Benchmark]: Toolchain (without parser) took 591.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:44,713 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:15:44,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:15:44,715 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 589.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: only flexible array member at the end can have non-constant size de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: only flexible array member at the end can have non-constant size: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeMemberOffset(TypeSizeAndOffsetComputer.java:583) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...